A new planarity test (Q1960413): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An $O(m\log n)$-Time Algorithm for the Maximal Planar Subgraph Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A linear algorithm for embedding planar graphs using PQ-trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient Planarity Testing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5596083 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3219752 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Depth-First Search and Kuratowski Subgraphs / rank | |||
Normal rank |
Latest revision as of 11:01, 29 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A new planarity test |
scientific article |
Statements
A new planarity test (English)
0 references
12 January 2000
0 references
planarity test
0 references
linear time testing algorithm
0 references
depth-first search tree
0 references
planar embeddings
0 references
0 references