Listing minimal edge-covers of intersecting families with applications to connectivity problems

DOI10.1016/J.DAM.2008.04.026MaRDI QIDQ1003760zbMATH OpenOpenAlexFDO

Authors Zeev Nutov

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

zbMATH Keywords

intersecting familieslistingminimal edge-coversSteiner network

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Approximating minimum power covers of intersecting families and directed edge-connectivity problems
• Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems
• Enumerating Spanning and Connected Subsets in Graphs and Matroids
• Approximating minimum-cost edge-covers of crossing biset-families
• Integer Programming and Combinatorial Optimization

Cites work

• Algorithms and Computation
• An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs
• Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
• Finding All Spanning Trees of Directed and Undirected Graphs
• Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
• Generating Minimal k-Vertex Connected Spanning Subgraphs
• Integer Programming and Combinatorial Optimization
• Mathematical Foundations of Computer Science 2004
• On generating all maximal independent sets
• The Complexity of Enumeration and Reliability Problems

Cited in

(1)

• Enumeration of support-closed subsets in confluent systems

This page was built for publication: Listing minimal edge-covers of intersecting families with applications to connectivity problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1003760)