4 search results - page 1 / 1 » A Parameterized Perspective on Packing Paths of Length Two |
COCOA
2008
Springer
14 years 21 days ago
2008
Springer
We study (vertex-disjoint) packings of paths of length two (i.e., of P2's) in graphs under a parameterized perspective. Starting from a maximal P2-packing P of size j we use e...
IWPEC
2009
Springer
14 years 5 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...
HEURISTICS
2002
13 years 10 months ago
2002
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...
WEBI
2005
Springer
14 years 4 months ago
2005
Springer
This work presents a new perspective on characterizing the similarity between elements of a database or, more generally, nodes of a weighted, undirected, graph. It is based on a M...