39 search results - page 2 / 8 » Kernel Bounds for Disjoint Cycles and Disjoint Paths |
SOFSEM
2007
Springer
13 years 12 months ago
2007
Springer
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...
STOC
1992
ACM
13 years 9 months ago
1992
ACM
Given an expander graph G = (V, E) and a set of q disjoint pairs of vertices in V , we are interested in finding for each pair (ai, bi), a path connecting ai to bi, such that the ...
ALGORITHMICA
2010
13 years 5 months ago
2010
We consider the online version of the maximum vertex disjoint path problem when the underlying network is a tree. In this problem, a sequence of requests arrives in an online fash...
IWPEC
2004
Springer
13 years 11 months ago
2004
Springer
The problem of packing k edge-disjoint triangles in a graph has been thoroughly studied both in the classical complexity and the approximation fields and it has a wide range of ap...
EJC
2007
13 years 5 months ago
2007
A minimal k-cycle is a family of sets A0, . . . , Ak−1 for which Ai ∩ Aj = ∅ if and only if i = j or i and j are consecutive modulo k. Let fr(n, k) be the maximum size of a ...