Listing minimal edge-covers of intersecting families with applications to connectivity problems
From MaRDI portal
Publication:1003760
DOI10.1016/j.dam.2008.04.026zbMath1228.05188OpenAlexW1964540732MaRDI QIDQ1003760
Publication date: 4 March 2009
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2008.04.026
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)
Related Items (1)
Cites Work
- On generating all maximal independent sets
- Generating Minimal k-Vertex Connected Spanning Subgraphs
- The Complexity of Enumeration and Reliability Problems
- Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
- Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
- Finding All Spanning Trees of Directed and Undirected Graphs
- An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs
- Mathematical Foundations of Computer Science 2004
- Integer Programming and Combinatorial Optimization
- Algorithms and Computation
This page was built for publication: Listing minimal edge-covers of intersecting families with applications to connectivity problems