Time Algorithm Maximal Planar by Cai Jiazhen (3 results)
- Softcover
Seller: PBShop.store US, Wood Dale, U.S.A.PBShop.store US
Contact seller5-star sellerCondition: New
£ 18.72
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, United KingdomPBShop.store UK
Contact seller5-star sellerCondition: New
£ 17.92
£ 3.29 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 seller4-star sellerCondition: New
£ 13.19
Free ShippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Paperback. Condition: New. Print on Demand. This book presents an efficient algorithm for finding a maximal planar subgraph, pushing the boundaries of existing algorithms in this area. The maximal planar subgraph problem involves finding a subset of edges in a graph that can be removed to make the graph planar, with the goal of…removing as few edges as possible. The author introduces a novel approach based on a modified version of Hopcroft and Tarjan's planarity testing algorithm, resulting in an algorithm with a time complexity of O(m log n), where m is the number of edges and n is the number of vertices in the graph. The book provides a clear and thorough explanation of the algorithm, making it accessible to readers with a background in graph theory and algorithms. By introducing this new approach, the author contributes to the ongoing research in graph algorithms and offers a valuable tool for solving problems involving the planarity of graphs. 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.
