Hierarchical planarity testing algorithms
From MaRDI portal
Publication:4710683
DOI10.1145/65950.65952zbMath0825.68418OpenAlexW1988625381MaRDI QIDQ4710683
Publication date: 25 June 1992
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/65950.65952
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items
Using the metro-map metaphor for drawing hypergraphs, The complexity of combinatorial problems with succinct input representation, On Radiocoloring Hierarchically Specified Planar Graphs: $$\mathcal{PSPACE}$$ -completeness and Approximations, Atomic Embeddability, Clustered Planarity, and Thickenability, Synchronized Planarity with Applications to Constrained Planarity Problems, Clustered planarity testing revisited, A new perspective on clustered planarity as a combinatorial embedding problem, \(c\)-planarity of embedded cyclic \(c\)-graphs, Model-checking hierarchical structures, Fixpoint logics over hierarchical structures, Orthogonal drawings of graphs for the automation of VLSI circuit design, The complexity of approximating PSPACE-complete problems for hierarchical specifications, The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems, Hierarchically specified unit disk graphs, On embedding a cycle in a plane graph, Bounded Embeddings of Graphs in the Plane, Hierarchically specified unit disk graphs, Beyond Clustered Planar Graphs, Simultaneous Embedding
