The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases (2007)
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.1002/net.20214
Publication URI: http://dx.doi.org/10.1002/net.20214
Type: Journal Article/Review
Parent Publication: Networks
Issue: 3