434 search results - page 3 / 87 » Improved Algorithms for the 2-Vertex Disjoint Paths Problem |
SPAA
2003
ACM
15 years 2 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
IPPS
2006
IEEE
15 years 3 months ago
2006
IEEE
IEICET
2006
14 years 9 months ago
2006
208
click to vote
COCOON
2011
Springer
13 years 9 months ago
2011
Springer
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...
JCT
1998
14 years 9 months ago
1998
We introduce a concept of so-called disjoint ordering for any collection of finite sets. It can be viewed as a generalization of a system of distinctive representatives for the s...