Lex

Browse

GenresShelvesPremiumBlog

Company

AboutJobsPartnersSell on LexAffiliates

Resources

DocsInvite FriendsFAQ

Legal

Terms of ServicePrivacy Policygeneral@lex-books.com(215) 703-8277

© 2026 LexBooks, Inc. All rights reserved.

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

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

Jiazhen Cai

Details

OL Work ID
OL16769841W

Find this book

Open Library
Book data from Open Library. Cover images courtesy of Open Library.