An O(n log n) algorithm for the maximal planar subgraph problem
by Jiazhen Cai
199227 pages
Courant Institute of Mathematical Sciences, New York University·1 editions
Loading Description
Tags
NewBookshelves
0 readersNo users with this book on their shelves. Maybe you could be the first.
Threads
0 discussionsQuotes
0 quotesReviews
0 reviewsNo reviews yet. Add your review.
Lists
0 listsNo lists containing this book.