Covering graphs with few complete bipartite subgraphs (2009)
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.1016/j.tcs.2008.12.059
Publication URI: http://dx.doi.org/10.1016/j.tcs.2008.12.059
Type: Journal Article/Review
Parent Publication: Theoretical Computer Science
Issue: 21-23