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.
Seller: Forgotten Books, London, United Kingdom
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. Seller Inventory # 9781332172894_0
Quantity: Over 20 available
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781332172894
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781332172894
Quantity: 15 available