Algorithm Maximal Planar Subgraph by Cai Jiazhen (6 results)

- Softcover
Seller: BargainBookStores, Grand Rapids, MI, U.S.A.BargainBookStores
Contact seller5-star sellerCondition: New
US$ 18.20
Free ShippingShips within U.S.A.Quantity: 5 available
Paperback or Softback. Condition: New. An O(n log n) Algorithm for the Maximal Planar Subgraph Problem. Book.

- Softcover
Seller: California Books, Miami, FL, U.S.A.California Books
Contact seller5-star sellerCondition: New
US$ 20.00
US$ 3.00 shippingShips within U.S.A.Quantity: Over 20 available
Condition: New.

- Softcover
Seller: PBShop.store US, Wood Dale, IL, U.S.A.PBShop.store US
Contact seller5-star sellerCondition: New
US$ 27.43
Free ShippingShips within U.S.A.Quantity: 15 available
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.

- Softcover
Seller: PBShop.store UK, Fairford, GLOS, United KingdomPBShop.store UK
Contact seller5-star sellerCondition: New
US$ 27.38
US$ 4.33 shippingShips from United Kingdom to U.S.A.Quantity: 15 available
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.

- Softcover
- Print on Demand
Seller: Forgotten Books, London, United KingdomForgotten Books
Contact seller5-star sellerCondition: New
US$ 17.22
Free ShippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Paperback. Condition: New. No Jacket. 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. print-on-demand item.…

- Softcover
- Print on Demand
Seller: Majestic Books, Hounslow, United KingdomMajestic Books
Contact seller4-star sellerCondition: New
US$ 22.48
US$ 8.54 shippingShips from United Kingdom to U.S.A.Quantity: 4 available
Condition: New. Print on Demand pp. 32.