Items related to An O(m Log N) Time Algorithm for the Maximal Planar...
Synopsis
Excerpt from An O(m Log N) Time Algorithm for the Maximal Planar Subgraph Problem
Observation 2. Let G, be the undirected graph represented by Fig. 3, in which P is a path joining the two vertices a and b on cycle C. Then in any embedding of G1, all the edges of path P are on the same side of the cycle C (either inside or outside).
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
"synopsis" may belong to another edition of this title.
- PublisherForgotten Books
- Publication date2018
- ISBN 10 0484063669
- ISBN 13 9780484063661
- BindingHardcover
- LanguageEnglish
- Number of pages37
(No Available Copies)
Search Books: Create a WantCan'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
