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

by Jiazhen Cai

0 ratings • 0 reviews • 0 shelved
Book cover for An O(m Log N) Time Algorithm for the Maximal Planar Subgraph Problem (Classic Reprint)
Shelve It

Bookhype may earn a small commission from qualifying purchases. Full disclosure.

  • ISBN10 0484063669
  • ISBN13 9780484063661
  • Publish Date 3 May 2018
  • Publish Status Active
  • Publish Country GB
  • Imprint Forgotten Books
  • Format Hardcover
  • Pages 34
  • Language English