An O(m Log N) Time Algorithm for the Maximal Planar Subgraph Problem

Language: English

Published by Forgotten Books, London, 2018

133217289X / 9781332172894

  • Softcover
  • New
See all details

Seller: Forgotten Books, London, United KingdomForgotten Books

5-star seller

AbeBooks seller since June 2, 2021

Softcover

Condition: New

US$ 17.22

 Free Shipping 
Ships from United Kingdom to U.S.A.

Quantity: Over 20 available

Add to basket
Free 30-day returns

Item description from seller

Print on Demand. Discover an efficient approach to maximal planar subgraphs that runs in near-linear time. This book presents an algorithmic solution for finding maximal planar subgraphs with an emphasis on speed and practical data structures. It builds on established planarity testing ideas and introduces refinements that make the method work well for a broad class of graphs. The result is a clearer path from theory to implementable code, suitable for researchers and practitioners alike.Readers will gain a concrete picture of how to combine depth-first search techniques, specialized data structures, and careful ordering of graph components to achieve strong performance. The approach also covers how to extend planarity concepts to handle more general cases, including non-biconnected graphs, while keeping the implementation approachable. How the O(m log n) time bound is achieved for the maximal planar subgraph problem How to work with DFS representations and attach- ment structures to manage back edges Strategies for handling non-biconnected graphs and maintaining planarity during updates Practical data structures like selection trees and bucket sorting to support fast operationsIdeal for readers of advanced graph algorithms and researchers exploring planarity and subgraph problems. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book.…

Title
An O(m Log N) Time Algorithm for the Maximal Planar Subgraph Problem
Author
Jiazhen Cai, Xiaofeng Han
Publisher
Forgotten Books, London
Publication year
2018
Condition
New
Dust jacket
No Jacket
Book Type
print-on-demand item
Binding
Paperback
Language
English
ISBN 10
133217289X
ISBN 13
9781332172894
Dimensions
5.98 x 0.25 x 9.02 inches
Seller catalogs
Geometry

Forgotten Books

London, United Kingdom

5-star seller

AbeBooks seller since June 2, 2021

Shipping rates from United Kingdom to U.S.A.

Item5 to 10 business days5 to 10 business days
First itemUS$ 0.00US$ 0.00
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.

Payment methods

  • Visa
  • Mastercard
  • American Express
  • Apple Pay
  • Google Pay

Store description

Forgotten Books’ Classic Reprint Series utilizes the latest technology to regenerate facsimiles of historically important writings. Careful attention has been made to accurately preserve the original format of each page whilst digitally enhancing the quality of the aged text.

Specialty

Trade

Seller's business information

FB &c Ltd

Dalton House, 60 Windsor Avenue
London, United Kingdom SW19 2RR