Bijective comparison of optimal planarity algorithms (Q4838131): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
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: The two basic linear time Planarity algorithms: Are they the same? / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient Planarity Testing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Embedding Graphs in the Plane—Algorithmic Aspects / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4552272 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Ranking and unranking planar embeddings / rank | |||
Normal rank |
Latest revision as of 14:37, 23 May 2024
scientific article; zbMATH DE number 770429
Language | Label | Description | Also known as |
---|---|---|---|
English | Bijective comparison of optimal planarity algorithms |
scientific article; zbMATH DE number 770429 |
Statements
Bijective comparison of optimal planarity algorithms (English)
0 references
20 November 1995
0 references
planarity testing
0 references
graph embedding
0 references
Hopcroft-Tarian algorithm
0 references
0 references