📣 Help Shape the Future of UKRI's Gateway to Research (GtR)

We're improving UKRI's Gateway to Research and are seeking your input! If you would be interested in being interviewed about the improvements we're making and to have your say about how we can make GtR more user-friendly, impactful, and effective for the Research and Innovation community, please email gateway@ukri.org.

Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms

First Author: Golovach P

Attributed to: Algorithmic Aspects of Graph Coloring funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1007/978-3-642-11269-0_17

Publication URI: http://dx.doi.org/10.1007/978-3-642-11269-0_17

Type: Book Chapter

Book Title: Parameterized and Exact Computation - 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers (2009)

Page Reference: 210-221

ISSN: 03029743 16113349