An edition of An O(n log n) algorithm for the maximal planar subgraph problem (1992)

An O(n log n) algorithm for the maximal planar subgraph problem

by

  • 0 Ratings
  • 0 Want to read
  • 0 Currently reading
  • 0 Have read
Cover of: An O(n log n) algorithm for the maximal planar subgraph problem by Jiazhen Cai
Read Listen

My Reading Lists:

Create a new list

Check-In

×Close
Add an optional check-in date. Check-in dates are used to track yearly reading goals.
Today
Notes
  • 0 Ratings
  • 0 Want to read
  • 0 Currently reading
  • 0 Have read
Notes

Download Options

Buy this book

Last edited by ImportBot
August 8, 2012 | History
Edit
An edition of An O(n log n) algorithm for the maximal planar subgraph problem (1992)

An O(n log n) algorithm for the maximal planar subgraph problem

by

  • 0 Ratings
  • 0 Want to read
  • 0 Currently reading
  • 0 Have read

This edition doesn't have a description yet. Can you add one?

Publish Date
Publisher
Courant Institute of Mathematical Sciences, New York University
Language
English
Pages
27

Buy this book

Previews available in: English

Edition Availability
Cover of: An O(n log n) algorithm for the maximal planar subgraph problem
An O(n log n) algorithm for the maximal planar subgraph problem
1992, Courant Institute of Mathematical Sciences, New York University
in English

Add another edition?

Book Details

Edition Notes

Published in
New York

The Physical Object

Pagination
27 p.
Number of pages
27

ID Numbers

Open Library
OL25405048M
Internet Archive
onlognalgorithmf00caij

Source records

Internet Archive item record

Community Reviews (0)

Feedback?
No community reviews have been submitted for this work.

Lists

This work does not appear on any lists.

History

Download catalog record: RDF / JSON
August 8, 2012 Created by ImportBot import new book