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...

time planarity testing, embedding, Kuratowski subgraph isolation, and straight-line drawing. 3 Utilities Puzzle and Planar Graphs NetLogo Planarity model...

Di Battista, G.; Mannino, C.; Tamassia, R. (1993), "Optimal upward planarity testing of single-source digraphs" (PDF), Proc. 1st European Symposium on...

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...

mathematics, the left-right planarity test or de Fraysseix–Rosenstiehl planarity criterion is a characterization of planar graphs based on the properties...

Finding the global minimum solution of a Hartree-Fock problem Upward planarity testing Hospitals-and-residents problem with couples Knot genus Latin square...

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...

algorithm. The Hopcroft–Tarjan planarity testing algorithm was the first linear-time algorithm for planarity testing. Tarjan has also developed important...

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...

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...

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...

mathematical calculation being performed. For LEDA's planarity testing function, If the graph is planar, a combinatorial embedding is produced as a witness...

the PC tree. The data structure operations required to perform a planarity testing algorithm on PC trees are somewhat simpler than the corresponding...

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...

MR 1616556. Holm, Jacob; Rotenberg, Eva (2020). "Fully-dynamic planarity testing in polylogarithmic time". In Makarychev, Konstantin; Makarychev, Yury;...

1137/0217004. Di Battista, Giuseppe; Tamassia, Roberto (1989), "Incremental planarity testing", Proc. 30th Annual Symposium on Foundations of Computer Science,...

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...

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...

Lempel, Even & Cederbaum (1967) formulated st-numberings as part of a planarity testing algorithm, and Rosenstiehl & Tarjan (1986) formulated bipolar orientations...

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...

graph theory, planar graphs, and graph drawing. The Fraysseix-Rosenstiehl's planarity criterion is at the origin of the left-right planarity algorithm implemented...

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...

mathematician and computer scientist known for her work on graph algorithms, planarity testing, and algorithms in enumerative combinatorics. She is a professor emeritus...

(2001), "On the computational complexity of upward and rectilinear planarity testing", SIAM Journal on Computing, 31 (2): 601–625, doi:10.1137/S0097539794277123...

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...

bridge. In planarity testing, H is a cycle and a peripheral cycle is a cycle with at most one bridge; it must be a face boundary in any planar embedding...

including testing connectivity, recognizing series–parallel graphs, and constructing st-numberings of graphs (an important subroutine in planarity testing). An...

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...

; Spencer, Thomas H. (1996), "Separator based sparsification. I. Planarity testing and minimum spanning trees", Journal of Computer and System Sciences...

tensile testing is a versatile technique to address the mechanical characterization of planar materials. It is a generalized form of tensile testing in which...