On the complete width and edge clique cover problems

DOI10.1007/978-3-319-21398-9_42MaRDI QIDQ6827023zbMATH OpenFDO

Authors Van Bang Le, Sheng-Lung Peng

Publication date 29 October 2015

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

Full work available at URL https://doi.org/10.1007/978-3-319-21398-9_42

zbMATH Keywords

bipartite graphscomplete widthedge clique coverprobe graphssplit graphs

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Analysis of algorithms and problem complexity (68Q25)

This page was built for publication: On the complete width and edge clique cover problems

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