Pages that link to "Item:Q4710683"

The following pages link to Hierarchical planarity testing algorithms (Q4710683):

Displaying 23 items.

• Model-checking hierarchical structures (Q414908) (← links)
• Using the metro-map metaphor for drawing hypergraphs (Q831834) (← links)
• Clustered planarity testing revisited (Q895058) (← links)
• A new perspective on clustered planarity as a combinatorial embedding problem (Q897898) (← links)
• On embedding a cycle in a plane graph (Q1011765) (← links)
• The complexity of combinatorial problems with succinct input representation (Q1090455) (← links)
• The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems (Q1185244) (← links)
• Hierarchically specified unit disk graphs (Q1269904) (← links)
• \(c\)-planarity of embedded cyclic \(c\)-graphs (Q1693313) (← links)
• Orthogonal drawings of graphs for the automation of VLSI circuit design (Q1966107) (← links)
• NodeTrix planarity testing with small clusters (Q2319629) (← links)
• Fixpoint logics over hierarchical structures (Q2429724) (← links)
• Bounded Embeddings of Graphs in the Plane (Q2819488) (← links)
• On Radiocoloring Hierarchically Specified Planar Graphs: $$\mathcal{PSPACE}$$ -completeness and Approximations (Q3464470) (← links)
• (Q4501524) (← links)
• The complexity of approximating PSPACE-complete problems for hierarchical specifications (Q4630250) (← links)
• (Q4635976) (← links)
• (Q4635977) (← links)
• Beyond Clustered Planar Graphs (Q5001664) (← links)
• Simultaneous Embedding (Q5001665) (← links)
• Atomic Embeddability, Clustered Planarity, and Thickenability (Q5066950) (← links)
• Fast incremental planarity testing (Q5204329) (← links)
• Synchronized Planarity with Applications to Constrained Planarity Problems (Q6075858) (← links)