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.

Product Description:

Excerpt from An O(m Log N) Time Algorithm for the Maximal Planar Subgraph Problem An O(M Log N) - Time Algorithm for the Maximal Planar Subgraph Problem was written by Jiazhen Cai and Xiaofeng Han in 1992. This is a 30 page book, containing 11470 words and 22 pictures. Search Inside is enabled for this title. 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.

"About this title" may belong to another edition of this title.

Store Description

**Please note our transit times are from the date of dispatch.** We first started out as ?The Paperback Exchange,? a chain of physical bookstores where we would part exchange your beloved books for new stories to transport you to faraway places. However, as shopping started to evolve to online shops and marketplaces, we bid our stores goodbye to become ?PBShop.? This transition has only allowed us to blossom as we now ship thousands of titles to book lovers across the globe. We pride ourselves in being a community of local book lovers which allows our passion and devotion to shine in everything we do. In 2020 we not only celebrated our 20th birthday but our 1st birthday as being completely employee owned after becoming an E.O.T in September 2019. We are proud to be different and embrace standing apart on a book mountain by working from a virtual inventory which allows us to provide thousands of books that may be difficult to get for your bookshelf or your studies. Working with a number of different suppliers allows us to explore other avenues such as puzzles, sheet music and even stationery so we really do have something for everyone. Life is about being versatile in all realms of existence. If this is your first purchase with us, or you are a returning customer, we would like to welcome you to the PBShop family, for there is no friend as loyal as a book. We are a company who put our customers at the centre of everything we do as we understand the importance of reading because once you learn to read, you will forever be free. There are a whole lot of things in this world of ours that we are yet to explore, which is why we will forever inspire curious minds.

Visit Seller's Storefront

Seller's business information

Pbshop.co.uk
Unit 22 Horcott Industrial Estate, Horcott Road, Fairford, GL7 4BX, United Kingdom

Terms of Sale:

Returns Policy
We ask all customers to contact us for authorisation should they wish to return their order. Orders returned without authorisation may not be credited.
If you wish to return, please contact us within 14 days of receiving your order to obtain authorisation.
Returns requested beyond this time will not be authorised.
Our team will provide full instructions on how to return your order and once received our returns department will process your refund.
Please note the cost to return any...

More Information

Shipping Terms:

Orders are shipped from our UK warehouse. Delivery thereafter is between 4 and 14 business days. Please contact us if you have any queries about our services or products.

Payment Methods
accepted by seller

Add to Wants

Items related to An Om Log N Time Algorithm for the Maximal Planar Subgraph...

An Om Log N Time Algorithm for the Maximal Planar Subgraph Problem Classic Reprint

Jiazhen Cai

New - Soft cover

Seller's business information