On enumerating minimal dicuts and strongly connected subgraphs (Q2471808): Difference between revisions

@@ Property / cites work @@
+Determination of All Minimal Cut-Sets between a Vertex Pair in an Undirected Graph
+Normal rank
@@ Property / cites work @@
+A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
+Normal rank
@@ Property / cites work @@
+Q4198785
@@ Property / cites work: Q4198785 / rank @@
+Normal rank
@@ Property / cites work @@
+Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph
+Normal rank
@@ Property / cites work @@
+An efficient network flow code for finding all minimum cost \(s-t\) cutsets
+Normal rank
@@ Property / cites work @@
+Identifying the Minimal Transversals of a Hypergraph and Related Problems
+Normal rank
@@ Property / cites work @@
+On the Complexity of Dualization of Monotone Disjunctive Normal Forms
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Extracting maximal information about sets of minimum cuts
+Normal rank
@@ Property / cites work @@
+Random generation of combinatorial structures from a uniform distribution
+Normal rank
@@ Property / cites work @@
+Generating all vertices of a polyhedron is hard
@@ Property / cites work: Generating all vertices of a polyhedron is hard / rank @@
+Normal rank
@@ Property / cites work @@
+Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
+Normal rank
@@ Property / cites work @@
+Computing Network Reliability in Time Polynomial in the Number of Cuts
+Normal rank
@@ Property / cites work @@
+A paradigm for listing \((s,t)\)-cuts in graphs
@@ Property / cites work: A paradigm for listing \((s,t)\)-cuts in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
+Normal rank
@@ Property / cites work @@
+On enumerating all minimal solutions of feedback problems
+Normal rank