Synopsis
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.
"synopsis" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for An O(m Log N) Time Algorithm for the Maximal Planar...
Seller Image
An O(m Log N) Time Algorithm for the Maximal Planar Subgraph Problem
Print on DemandSeller: Forgotten Books, London, United Kingdom
Seller rating 4 out of 5 stars
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. Seller Inventory # 9781332172894_0
Buy New
US$ 17.22
Free Shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
An Om Log N Time Algorithm for the Maximal Planar Subgraph Problem Classic Reprint
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781332172894
Stock Image
An Om Log N Time Algorithm for the Maximal Planar Subgraph Problem Classic Reprint
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781332172894
Buy New
US$ 28.02
US$ 4.43 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 15 available