Pages that link to "Item:Q1083864"

The following pages link to A linear algorithm for embedding planar graphs using PQ-trees (Q1083864):

Displaying 38 items.

• Minimum strictly fundamental cycle bases of planar graphs are hard to find (Q266952) (← links)
• Linkless and flat embeddings in 3-space (Q420569) (← links)
• Faster computation of the Robinson-Foulds distance between phylogenetic networks (Q454925) (← links)
• Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges (Q634247) (← links)
• 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)
• Metric dimension of maximal outerplanar graphs (Q2045286) (← links)
• On the complexity of recognizing Wheeler graphs (Q2118211) (← links)
• Planar rectilinear drawings of outerplanar graphs in linear time (Q2123284) (← links)
• Treetopes and their graphs (Q2197683) (← links)
• Discrete trace theorems and energy minimizing spring embeddings of planar graphs (Q2226448) (← links)
• Tree-decompositions with bags of small diameter (Q2370441) (← links)
• Planar median graphs and cubesquare-graphs (Q2691567) (← links)
• (Q2702747) (← links)
• Algorithms for Drawing Planar p-petal Graphs (Q2831832) (← links)
• Obstructions for the Disk and the Cylinder Embedding Extension Problems (Q4314155) (← links)
• Branch-and-bound techniques for the maximum planar subgraph problem^∗ (Q4844576) (← links)
• On triangulating planar graphs under the four-connectivity constraint (Q5056168) (← links)
• A dichotomy result for cyclic-order traversing games (Q5091020) (← links)
• Geometry and Generation of a New Graph Planarity Game (Q5233138) (← 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)
• Find subtrees of specified weight and cycles of specified length in linear time (Q6056757) (← links)