A new planarity test (Q1960413): Difference between revisions

@@ Property / Wikidata QID @@
+Q56341894
@@ Property / Wikidata QID: Q56341894 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
+Normal rank
@@ Property / cites work @@
+An $O(m\log n)$-Time Algorithm for the Maximal Planar Subgraph Problem
+Normal rank
@@ Property / cites work @@
+A linear algorithm for embedding planar graphs using PQ-trees
+Normal rank
@@ Property / cites work @@
+Efficient Planarity Testing
@@ Property / cites work: Efficient Planarity Testing / rank @@
+Normal rank
@@ Property / cites work @@
+Q5596083
@@ Property / cites work: Q5596083 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3219752
@@ Property / cites work: Q3219752 / rank @@
+Normal rank
@@ Property / cites work @@
+On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm
+Normal rank
@@ Property / cites work @@
+Depth-First Search and Kuratowski Subgraphs
@@ Property / cites work: Depth-First Search and Kuratowski Subgraphs / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1960413