Fast incremental planarity testing (Q5204329): 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.1007/3-540-55719-9_86
+Normal rank
@@ Property / OpenAlex ID @@
+W1550834367
@@ Property / OpenAlex ID: W1550834367 / rank @@
+Normal rank
@@ Property / cites work @@
+Incremental convex planarity testing
@@ Property / cites work: Incremental convex planarity testing / rank @@
+Normal rank
@@ Property / cites work @@
+Q4038721
@@ Property / cites work: Q4038721 / 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 @@
+Dynamic Perfect Hashing: Upper and Lower Bounds
@@ Property / cites work: Dynamic Perfect Hashing: Upper and Lower Bounds / rank @@
+Normal rank
@@ Property / cites work @@
+Q3138921
@@ Property / cites work: Q3138921 / rank @@
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for a special case of disjoint set union
+Normal rank
@@ Property / cites work @@
+The Two-Triangle Case of the Acquaintance Graph
@@ Property / cites work: The Two-Triangle Case of the Acquaintance Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Finding Nearest Common Ancestors
+Normal rank
@@ Property / cites work @@
+Dividing a Graph into Triconnected Components
@@ Property / cites work: Dividing a Graph into Triconnected Components / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Planarity Testing
@@ Property / cites work: Efficient Planarity Testing / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic orthogonal segment intersection search
@@ Property / cites work: Dynamic orthogonal segment intersection search / rank @@
+Normal rank
@@ Property / cites work @@
+Maintenance of triconnected components of graphs
@@ Property / cites work: Maintenance of triconnected components of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Efficiency of a Good But Not Linear Set Union Algorithm
+Normal rank