Covering Graphs with Few Complete Bipartite Subgraphs
Attributed to:
Exact algorithms for NP-hard problems
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1007/978-3-540-77050-3_28
Publication URI: http://dx.doi.org/10.1007/978-3-540-77050-3_28
Type: Book Chapter
Book Title: FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science - 27th International Conference, New Delhi, India, December 12-14, 2007. Proceedings (2007)
Page Reference: 340-351
ISBN: 978-3-540-77049-7
ISSN: 1436-3798