Partitioning Graphs into Connected Parts
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-642-03351-3_15
Publication URI: http://dx.doi.org/10.1007/978-3-642-03351-3_15
Type: Book Chapter
Book Title: Computer Science - Theory and Applications (2009)
Page Reference: 143-154
ISBN: 978-3-642-03350-6
ISSN: 0165-0009