Packing Bipartite Graphs with Covers of Complete Bipartite Graphs
From MaRDI portal
Publication:3563009
DOI10.1007/978-3-642-13073-1_25zbMath1284.05273OpenAlexW1480337396MaRDI QIDQ3563009
Jérémie Chalopin, Daniël Paulusma
Publication date: 28 May 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://dro.dur.ac.uk/10699/1/10699.pdf
Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (1)
This page was built for publication: Packing Bipartite Graphs with Covers of Complete Bipartite Graphs
