Enumerating Spanning and Connected Subsets in Graphs and Matroids

[1]  Tibor Jordán,et al.  Edge-connectivity augmentation with partition constraints , 1998, SODA '98.

[2]  Benno Schwikowski,et al.  On enumerating all minimal solutions of feedback problems , 2002, Discret. Appl. Math..

[3]  Vladimir Gurvich,et al.  Enumerating Spanning and Connected Subsets in Graphs and Matroids , 2006, ESA.

[4]  Leonid Khachiyan,et al.  On the Complexity of Dualization of Monotone Disjunctive Normal Forms , 1996, J. Algorithms.

[5]  Charles J. Colbourn,et al.  The Combinatorics of Network Reliability , 1987 .

[6]  Vladimir Gurvich,et al.  Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems , 2004, IPCO.

[7]  Vladimir Gurvich,et al.  Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph , 2001, SIAM J. Comput..

[8]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[9]  Eugene L. Lawler,et al.  Generating all Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms , 1980, SIAM J. Comput..

[10]  Georg Gottlob,et al.  Identifying the Minimal Transversals of a Hypergraph and Related Problems , 1995, SIAM J. Comput..

[11]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[12]  Robert E. Tarjan,et al.  Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees , 1975, Networks.

[13]  Vladimir Gurvich,et al.  An inequality for polymatroid functions and its applications , 2003, Discret. Appl. Math..

[14]  Takeaki Uno,et al.  An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs , 1997, SIAM J. Comput..

[15]  Toshihide Ibaraki,et al.  Complexity of Identification and Dualization of Positive Boolean Functions , 1995, Inf. Comput..

[16]  Vladimir Gurvich,et al.  Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs , 2005, ISAAC.

[17]  Toshihide Ibaraki,et al.  Optimal augmentation to make a graph k-edge-connected and triconnected , 1998, SODA '98.

[18]  László Lovász,et al.  Submodular functions and convexity , 1982, ISMP.

[19]  Georg Gottlob,et al.  New Results on Monotone Dualization and Generating Hypergraph Transversals , 2003, SIAM J. Comput..