162 search results - page 8 / 33 » The Induced Disjoint Paths Problem |
91
Voted
JCT
1998
15 years 2 days 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...
90
Voted
STACS
2010
Springer
15 years 7 months ago
2010
Springer
Testing whether there is an induced path in a graph spanning k given vertices is already NP-complete in general graphs when k = 3. We show how to solve this problem in polynomial t...
86
Voted
CORR
2008
Springer
15 years 15 days ago
2008
Springer
In wireless sensor networks, bandwidth is one of precious resources to multimedia applications. To get more bandwidth, multipath routing is one appropriate solution provided that ...
116
Voted
NETWORKS
2007
14 years 12 months ago
2007
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...
FOCS
1996
IEEE
15 years 4 months ago
1996
IEEE
In the minimum path coloring problem, we are given a list of pairs of vertices of a graph. We are asked to connect each pair by a colored path. Paths of the same color must be edg...