27 search results - page 2 / 6 » Existence and Construction of Edge Disjoint Paths on Expande... |
DM
2010
13 years 5 months ago
2010
A k-rainbow path in a graph with colored edges is a path of length k where each edge has a different color. In this note, we settle the problem of obtaining a constructive k-colori...
ISAAC
2004
Springer
13 years 10 months ago
2004
Springer
Let G be a graph containing N disjoint t-spanners that are inter-connected with M edges. We present an algorithm that constructs a data structure of size O(M2 + n log n) that answ...
SPAA
2003
ACM
13 years 10 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...
ISCAPDCS
2007
13 years 6 months ago
2007
With rapid increase of parallel computation systems in their sizes, it is inevitable to develop algorithms that are applicable even if there exist faulty elements in the systems. ...
COCOON
2011
Springer
12 years 5 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...