On the Conjunctive Capacity of Graphs

DOI10.1007/978-3-642-38768-5_26zbMath1381.05053OpenAlexW1862378619MaRDI QIDQ4925245

Miroslav Chlebík, Janka Chlebíková

Publication date: 11 June 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://researchportal.port.ac.uk/portal/en/publications/on-the-conjunctive-capacity-of-graphs(ebfde120-fcd8-4dd1-b025-aef1c9b1380e).html

zbMATH Keywords

binding numbercompound channelfractional vertex covergraph capacitiesShannon capacity for graph familiesstrong crown decomposition

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Convex programming (90C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Information theory (general) (94A15)

This page was built for publication: On the Conjunctive Capacity of Graphs