153 search results - page 8 / 31 » Edge Disjoint Paths in Moderately Connected Graphs |
216
click to vote
MLQ
2011
14 years 10 months ago
2011
Given a graph G whose set of vertices is a Polish space X, the weak Borel chromatic number of G is the least size of a family of pairwise disjoint G-independent Borel sets that cov...
120
click to vote
SODA
2010
ACM
16 years 22 days ago
2010
ACM
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...
105
click to vote
STOC
1993
ACM
15 years 7 months ago
1993
ACM
We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...
110
Voted
ESA
2010
Springer
15 years 4 months ago
2010
Springer
Minor containment is a fundamental problem in Algorithmic Graph Theory, as numerous graph algorithms use it as a subroutine. A model of a graph H in a graph G is a set of disjoint ...
160
click to vote
ISAAC
1992
Springer
15 years 7 months ago
1992
Springer
Let G be an undirected plane graph with non-negative edge length, and let k terminal pairs lie on two specified face boundaries. This paper presents an algorithm for finding k &quo...