46 search results - page 1 / 10 » On Parameterized Path and Chordless Path Problems |
81
Voted
COCO
2007
Springer
15 years 4 months ago
2007
Springer
101
click to vote
IWPEC
2004
Springer
15 years 5 months ago
2004
Springer
Consider the following problem, that we call “Chordless Path through Three Vertices” or CP3V, for short: Given a simple undirected graph G = (V, E), a positive integer k, and t...
TCS
2010
14 years 7 months ago
2010
In this paper we show that the problem of finding a chordless path between a vertex s and a vertex t containing a vertex v remains NP-complete in bipartite graphs, thereby strengt...
95
Voted
ESA
2010
Springer
15 years 1 months ago
2010
Springer
We consider parameterized convex optimization problems over the unit simplex, that depend on one parameter. We provide a simple and efficient scheme for maintaining an -approximat...
99
Voted
IWPEC
2009
Springer
15 years 7 months ago
2009
Springer
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...