Listing minimal edge-covers of intersecting families with applications to connectivity problems (Q1003760): Difference between revisions

@@ Property / DOI @@
-.1016/j.dam.2008.04.026
@@ Property / DOI: 10.1016/j.dam.2008.04.026 / rank @@
-Normal rank
@@ Property / cites work @@
+Generating Minimal k-Vertex Connected Spanning Subgraphs
+Normal rank
@@ Property / cites work @@
+Integer Programming and Combinatorial Optimization
+Normal rank
@@ Property / cites work @@
+Mathematical Foundations of Computer Science 2004
@@ Property / cites work: Mathematical Foundations of Computer Science 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding All Spanning Trees of Directed and Undirected Graphs
+Normal rank
@@ Property / cites work @@
+On generating all maximal independent sets
@@ Property / cites work: On generating all maximal independent sets / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Computation
@@ Property / cites work: Algorithms and Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
+Normal rank
@@ Property / cites work @@
+Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
+Normal rank
@@ Property / cites work @@
+An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs
+Normal rank
@@ Property / cites work @@
+The Complexity of Enumeration and Reliability Problems
+Normal rank
@@ Property / DOI @@
+.1016/J.DAM.2008.04.026
@@ Property / DOI: 10.1016/J.DAM.2008.04.026 / rank @@
+Normal rank