Memory-efficient enumeration of constrained spanning trees (Q294700): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Generating rooted triangulations without repetitions
+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 @@
+The parallel search bench ZRAM and its applications
+Normal rank
@@ Property / cites work @@
+Complexity of spanning tree problems with leaf-dependent objectives
+Normal rank
@@ Property / cites work @@
+Q4363166
@@ Property / cites work: Q4363166 / rank @@
+Normal rank
@@ Property / cites work @@
+A good algorithm for smallest spanning trees with a degree constraint
+Normal rank
@@ Property / cites work @@
+Finding All Spanning Trees of Directed and Undirected Graphs
+Normal rank
@@ Property / cites work @@
+A short note on the approximability of the maximum leaves spanning tree problem
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum Diameter Spanning Trees and Related Problems
+Normal rank
@@ Property / cites work @@
+The NP-completeness column: An ongoing guide
@@ Property / cites work: The NP-completeness column: An ongoing guide / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of the network design problem
@@ Property / cites work: The complexity of the network design problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4763326
@@ Property / cites work: Q4763326 / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
+Normal rank
@@ Property / cites work @@
+EFFICIENTLY SCANNING ALL SPANNING TREES OF AN UNDIRECTED GRAPH
+Normal rank