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

@@ Property / Mathematics Subject Classification ID @@
+Q25
@@ Property / Mathematics Subject Classification ID: 68Q25 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+R10
@@ Property / Mathematics Subject Classification ID: 68R10 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+T20
@@ Property / Mathematics Subject Classification ID: 68T20 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6594058
@@ Property / zbMATH DE Number: 6594058 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+enumeration
@@ Property / zbMATH Keywords: enumeration / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+exhaustive search
@@ Property / zbMATH Keywords: exhaustive search / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+combinatorics
@@ Property / zbMATH Keywords: combinatorics / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+optimization
@@ Property / zbMATH Keywords: optimization / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+algorithms
@@ Property / zbMATH Keywords: algorithms / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+output-sensitive
@@ Property / zbMATH Keywords: output-sensitive / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+graphs
@@ Property / zbMATH Keywords: graphs / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+spanning trees
@@ Property / zbMATH Keywords: spanning trees / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+constraints
@@ Property / zbMATH Keywords: constraints / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+ZRAM
@@ Property / describes a project that uses: ZRAM / rank @@
+Normal rank
@@ 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
@@ links / mardi / name / links / mardi / name @@
+Publication:294700