Connection between conjunctive capacity and structural properties of graphs
From MaRDI portal
Publication:744094
DOI10.1016/j.tcs.2014.04.035zbMath1383.05254MaRDI QIDQ744094
Miroslav Chlebík, Janka Chlebíková
Publication date: 6 October 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.04.035
binding number; compound channel; fractional vertex cover; graph capacities; Shannon capacity for graph families; strong crown decomposition
90C35: Programming involving graphs or networks
90C25: Convex programming
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
94A15: Information theory (general)
Cites Work
- A Sperner-type theorem and qualitative independence
- Capacities: From information theory to extremal set theory
- Capacities of graphs and \(2\)-matchings
- Computing the binding number of a graph
- Sperner capacities
- Crown reductions for the minimum weighted vertex cover problem
- Which rational numbers are binding numbers?
- The binding number of a graph and its Anderson number
- Unnamed Item
- Unnamed Item
- Unnamed Item