162 search results - page 25 / 33 » The Induced Disjoint Paths Problem |
SODA
1990
ACM
13 years 8 months ago
1990
ACM
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...
JOIN
2007
13 years 7 months ago
2007
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
In the unconditionally reliable message transmission (URMT) problem, two non-faulty players, the sender S and the receiver R are part of a synchronous network modeled as a directe...
COMPGEOM
2008
ACM
13 years 9 months ago
2008
ACM
This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated ...
NETWORKING
2007
13 years 9 months ago
2007
Multicasting is one of the most important applications in Wireless Ad hoc Networks and the currently emerging Wireless Mesh Networks. In such networks, interference due to the shar...