Items related to An O(m Log N) Time Algorithm for the Maximal Planar...

An O(m Log N) Time Algorithm for the Maximal Planar Subgraph Problem (Classic Reprint) - Hardcover

Cai, Jiazhen

 
9780484063661: An O(m Log N) Time Algorithm for the Maximal Planar Subgraph Problem (Classic Reprint)
Hardcover
ISBN 10: 0484063669 ISBN 13: 9780484063661
Publisher: Forgotten Books, 2024

This specific ISBN edition is currently not available.

  • PublisherForgotten Books
  • Publication date2024
  • ISBN 10 0484063669
  • ISBN 13 9780484063661
  • BindingHardcover
  • LanguageEnglish
  • Number of pages33

(No Available Copies)

Search Books:



Create a Want

Can't find the book you're looking for? We'll keep searching for you. If one of our booksellers adds it to AbeBooks, we'll let you know!

Create a Want

Other Popular Editions of the Same Title

9781332172894: An O(m Log N) Time Algorithm for the Maximal Planar Subgraph Problem (Classic Reprint)

Featured Edition

ISBN 10:  133217289X ISBN 13:  9781332172894
Publisher: Forgotten Books, 2024
Softcover