Fast enumeration algorithms for non-crossing geometric graphs (Q5896957): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00454-009-9164-4
+Normal rank
@@ Property / OpenAlex ID @@
+W4233537290
@@ Property / OpenAlex ID: W4233537290 / rank @@
+Normal rank
@@ Property / cites work @@
+Transforming spanning trees and pseudo-triangulations
+Normal rank
@@ Property / cites work @@
+Gray code enumeration of plane straight-line graphs
+Normal rank
@@ Property / cites work @@
+Sequences of spanning trees and a fixed tree theorem
+Normal rank
@@ Property / cites work @@
+On the number of plane geometric graphs
@@ Property / cites work: On the number of plane geometric graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A quadratic distance bound on sliding between crossing-free spanning trees
+Normal rank
@@ Property / cites work @@
+A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
+Normal rank
@@ Property / cites work @@
+Reverse search for enumeration
@@ Property / cites work: Reverse search for enumeration / rank @@
+Normal rank
@@ Property / cites work @@
+Enumerating non-crossing minimally rigid frameworks
+Normal rank
@@ Property / cites work @@
+Enumerating constrained non-crossing minimally rigid frameworks
+Normal rank
@@ Property / cites work @@
+Enumerating pseudo-triangulations in the plane
@@ Property / cites work: Enumerating pseudo-triangulations in the plane / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms - ESA 2003
@@ Property / cites work: Algorithms - ESA 2003 / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for enumeration of triangulations
+Normal rank
@@ Property / cites work @@
+Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm
+Normal rank
@@ Property / cites work @@
+Triangulating a simple polygon in linear time
@@ Property / cites work: Triangulating a simple polygon in linear time / rank @@
+Normal rank
@@ Property / cites work @@
+Q2747613
@@ Property / cites work: Q2747613 / rank @@
+Normal rank
@@ Property / cites work @@
+Analytic combinatorics of non-crossing configurations
+Normal rank
@@ Property / cites work @@
+Q4279195
@@ Property / cites work: Q4279195 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
+Normal rank
@@ Property / cites work @@
+Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs
+Normal rank
@@ Property / cites work @@
+An algorithm for enumerating all spanning trees of a directed graph
+Normal rank
@@ Property / cites work @@
+Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees
+Normal rank
@@ Property / cites work @@
+Q2766814
@@ Property / cites work: Q2766814 / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs of non-crossing perfect matchings
@@ Property / cites work: Graphs of non-crossing perfect matchings / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs of triangulations and perfect matchings
@@ Property / cites work: Graphs of triangulations and perfect matchings / rank @@
+Normal rank
@@ Property / cites work @@
+Flipping edges in triangulations
@@ Property / cites work: Flipping edges in triangulations / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of detecting crossingfree configurations in the plane
+Normal rank
@@ Property / cites work @@
+Pebble game algorithms and sparse graphs
@@ Property / cites work: Pebble game algorithms and sparse graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the finiteness of the criss-cross method
@@ Property / cites work: On the finiteness of the criss-cross method / rank @@
+Normal rank
@@ Property / cites work @@
+A Survey of Combinatorial Gray Codes
@@ Property / cites work: A Survey of Combinatorial Gray Codes / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank
@@ Property / cites work @@
+EFFICIENTLY SCANNING ALL SPANNING TREES OF AN UNDIRECTED GRAPH
+Normal rank
@@ Property / cites work @@
+An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs
+Normal rank
@@ Property / cites work @@
+Q4370201
@@ Property / cites work: Q4370201 / rank @@
+Normal rank