o(n Log N) Algorithm for the Maximal Planar Subgraph ProblemJiazhen Cai
o(n Log N) Algorithm for the Maximal Planar Subgraph Problem
Jiazhen Cai, Xiaofeng Han, Robert E. Tarjan · 2018
Where to buy
Check today’s price on Amazon. We do not show prices because they change daily.
View on AmazonAffiliate link. As an Amazon Associate we earn from qualifying purchases.
Book details
- Year
- 2018
- Language
- English
- Publisher
- Creative Media Partners, LLC
- Editions
- 1
- ISBN
- 9781378112519
Data source: Wikidata