Paths of bounded length and their cuts: Parameterized complexity and algorithms (2011)
Attributed to:
Algorithmic Aspects of Graph Coloring
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1016/j.disopt.2010.09.009
Publication URI: http://dx.doi.org/10.1016/j.disopt.2010.09.009
Type: Journal Article/Review
Parent Publication: Discrete Optimization
Issue: 1