In graph theory, the planarity testing problem is the algorithmic problem of testing whether a given graph is a planar graph (that is, whether it can...
17 KB (1,818 words) - 00:50, 9 November 2023
time planarity testing, embedding, Kuratowski subgraph isolation, and straight-line drawing. 3 Utilities Puzzle and Planar Graphs NetLogo Planarity model...
35 KB (4,541 words) - 18:29, 29 May 2025
Hasse diagram (section Upward planarity)
Di Battista, G.; Mannino, C.; Tamassia, R. (1993), "Optimal upward planarity testing of single-source digraphs" (PDF), Proc. 1st European Symposium on...
11 KB (1,342 words) - 10:38, 16 December 2024
theorem, if a graph is planar, it can be drawn without crossings so that all of its edges are straight line segments. In the planarity game, the player is...
11 KB (1,310 words) - 06:53, 22 July 2024
In graph theory, Mac Lane's planarity criterion is a characterisation of planar graphs in terms of their cycle spaces, named after Saunders Mac Lane who...
9 KB (1,365 words) - 22:40, 27 February 2025
species is closer to one species or another in a phylogenetic tree. Planarity testing. Solving puzzles with only one solution, such as mazes. (DFS can be...
20 KB (2,447 words) - 12:33, 25 May 2025
Finding the global minimum solution of a Hartree-Fock problem Upward planarity testing Hospitals-and-residents problem with couples Knot genus Latin square...
29 KB (2,746 words) - 00:31, 24 April 2025
algorithm. The Hopcroft–Tarjan planarity testing algorithm was the first linear-time algorithm for planarity testing. Tarjan has also developed important...
18 KB (1,513 words) - 18:06, 27 April 2025
mathematics, the left-right planarity test or de Fraysseix–Rosenstiehl planarity criterion is a characterization of planar graphs based on the properties...
6 KB (696 words) - 22:38, 27 February 2025
special cases of upward planarity testing are known to be possible in polynomial time: Testing whether a graph is st-planar may be accomplished in linear...
20 KB (2,328 words) - 19:52, 29 July 2024
mathematical calculation being performed. For LEDA's planarity testing function, If the graph is planar, a combinatorial embedding is produced as a witness...
6 KB (675 words) - 15:36, 13 January 2025
chessboard. John Hopcroft and Robert Tarjan derived a means of testing the planarity of a graph in time linear to the number of edges. Their algorithm...
5 KB (565 words) - 01:25, 16 August 2024
the PC tree. The data structure operations required to perform a planarity testing algorithm on PC trees are somewhat simpler than the corresponding...
6 KB (763 words) - 05:13, 17 December 2024
for many graph-related algorithms, including topological sorts and planarity testing. Input: A graph G and a vertex v of G. Output: A labeling of the edges...
11 KB (1,492 words) - 19:56, 12 October 2024
1137/0217004. Di Battista, Giuseppe; Tamassia, Roberto (1989), "Incremental planarity testing", Proc. 30th Annual Symposium on Foundations of Computer Science,...
13 KB (1,853 words) - 12:52, 5 July 2024
MR 1616556. Holm, Jacob; Rotenberg, Eva (2020). "Fully-dynamic planarity testing in polylogarithmic time". In Makarychev, Konstantin; Makarychev, Yury;...
41 KB (5,003 words) - 04:16, 18 April 2025
preserving 1-planarity) that have significantly fewer than 4n − 8 edges. The bound of 4n − 8 on the maximum possible number of edges in a 1-planar graph can...
24 KB (2,757 words) - 12:14, 12 August 2024
Kuratowski's theorem (category Statements about planar graphs)
allows the correctness of a planarity testing algorithm to be verified for nonplanar inputs, as it is straightforward to test whether a given subgraph is...
9 KB (1,074 words) - 22:34, 27 February 2025
Plantar reflex (redirect from Extensor-planar reflex)
reflex hammers taper at the end of the handle to a point which was used for testing the plantar response in the past; due to the tightening of infection control...
11 KB (1,243 words) - 14:56, 8 November 2024
graph theory, planar graphs, and graph drawing. The Fraysseix-Rosenstiehl's planarity criterion is at the origin of the left-right planarity algorithm implemented...
3 KB (247 words) - 16:58, 25 July 2024
Squaregraph (category Planar graphs)
algorithm for testing whether a given graph is a squaregraph, without any need to use the more complex linear-time algorithms for planarity testing of arbitrary...
5 KB (646 words) - 19:39, 23 June 2022
Bipolar orientation (section Applications to planarity)
Lempel, Even & Cederbaum (1967) formulated st-numberings as part of a planarity testing algorithm, and Rosenstiehl & Tarjan (1986) formulated bipolar orientations...
15 KB (1,839 words) - 20:42, 19 January 2025
retrieved 2011-09-17. Garg, Ashim; Tamassia, Roberto (1995), "Upward planarity testing", Order, 12 (2): 109–133, CiteSeerX 10.1.1.10.2237, doi:10.1007/BF01108622...
31 KB (3,275 words) - 10:55, 8 May 2025
Book embedding (section Planarity and outerplanarity)
edges) is a planar graph. This characterization allows bi-secondary structures to be recognized in linear time as an instance of planarity testing. Blin et...
68 KB (8,167 words) - 00:16, 5 October 2024
mathematician and computer scientist known for her work on graph algorithms, planarity testing, and algorithms in enumerative combinatorics. She is a professor emeritus...
1 KB (97 words) - 12:31, 19 March 2023
tree-depth of a graph, and as part of the left-right planarity test for testing whether a graph is a planar graph. A characterization of Trémaux trees in the...
17 KB (2,302 words) - 07:42, 20 April 2025
(2001), "On the computational complexity of upward and rectilinear planarity testing", SIAM Journal on Computing, 31 (2): 601–625, doi:10.1137/S0097539794277123...
7 KB (733 words) - 07:18, 16 July 2024
Peter; Tamassia, Roberto; Tollis, Ioannis G. (1998), "Optimal Upward Planarity Testing of Single-Source Digraphs", Graph Drawing: Algorithms for the Visualization...
6 KB (544 words) - 11:25, 24 November 2024
tensile testing is a versatile technique to address the mechanical characterization of planar materials. It is a generalized form of tensile testing in which...
38 KB (5,045 words) - 23:42, 9 May 2025
SPQR-trees for various on-line graph algorithms, e.g., transitive closure, planarity testing, and minimum spanning tree. In particular, the authors proposed an...
10 KB (1,164 words) - 12:34, 10 December 2023