Pages that link to "Item:Q1083864"
From MaRDI portal
The following pages link to A linear algorithm for embedding planar graphs using PQ-trees (Q1083864):
Displayed 23 items.
- Drawing plane graphs nicely (Q797289) (← links)
- Dynamic maintenance of planar digraphs, with applications (Q911751) (← links)
- Upward drawings of triconnected digraphs. (Q960528) (← links)
- Bijective counting of plane bipolar orientations and Schnyder woods (Q1039437) (← links)
- Graph graphics: Theory and practice (Q1103411) (← links)
- Algorithms for plane representations of acyclic digraphs (Q1124349) (← links)
- Area requirement and symmetry display of planar upward drawings (Q1189288) (← links)
- On counting planar embeddings (Q1313885) (← links)
- A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs (Q1322567) (← links)
- Finding Hamiltonian circuits in arrangements of Jordan curves is NP- complete (Q1341680) (← links)
- A better heuristic for orthogonal graph drawings (Q1384200) (← links)
- Projective plan and Möbius band obstructions (Q1385984) (← links)
- Fixed edge-length graph drawing is NP-hard (Q1813977) (← links)
- Drawing planar graphs using the canonical ordering (Q1920418) (← links)
- On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm (Q1920431) (← links)
- A new planarity test (Q1960413) (← links)
- Tree-decompositions with bags of small diameter (Q2370441) (← links)
- (Q2702747) (← links)
- Obstructions for the Disk and the Cylinder Embedding Extension Problems (Q4314155) (← links)
- Branch-and-bound techniques for the maximum planar subgraph problem<sup>∗</sup> (Q4844576) (← links)
- Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges (Q5302051) (← links)
- Practical Level Planarity Testing and Layout with Embedding Constraints (Q5452211) (← links)
- Topological recognition of polyhedral objects from multiple views (Q5940959) (← links)