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.

o(n Log N) Algorithm for the Maximal Planar Subgraph Problem

o(n Log N) Algorithm for the Maximal Planar Subgraph Problem2018

Robert E. Tarjan, Jiazhen Cai, Xiaofeng Han

Details

First published
2018
OL Work ID
OL28535751W

Find this book

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