Synopsis
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 operations
Ideal for readers of advanced graph algorithms and researchers exploring planarity and subgraph problems.
"synopsis" may belong to another edition of this title.
