4865 search results - page 25 / 973 » The Complexity of Graph Connectivity |
ARSCOM
2008
13 years 10 months ago
2008
COMBINATORICA
2002
13 years 10 months ago
2002
KDD
2004
ACM
14 years 10 months ago
2004
ACM
We define a connection subgraph as a small subgraph of a large graph that best captures the relationship between two nodes. The primary motivation for this work is to provide a pa...
SIAMDM
2008
13 years 10 months ago
2008
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...
STOC
2010
ACM
14 years 2 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...