Bijective comparison of optimal planarity algorithms (Q4838131): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1080/03081089508818361
+Normal rank
@@ Property / OpenAlex ID @@
+W2036322986
@@ Property / OpenAlex ID: W2036322986 / 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 @@
+The two basic linear time Planarity algorithms: Are they the same?
+Normal rank
@@ Property / cites work @@
+Efficient Planarity Testing
@@ Property / cites work: Efficient Planarity Testing / rank @@
+Normal rank
@@ Property / cites work @@
+Depth-First Search and Linear Graph Algorithms
@@ Property / cites work: Depth-First Search and Linear Graph Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Embedding Graphs in the Plane—Algorithmic Aspects
+Normal rank
@@ Property / cites work @@
+Q4552272
@@ Property / cites work: Q4552272 / rank @@
+Normal rank
@@ Property / cites work @@
+Ranking and unranking planar embeddings
@@ Property / cites work: Ranking and unranking planar embeddings / rank @@
+Normal rank