374 search results - page 13 / 75 » Stochastic Minority on Graphs |
SODA
2010
ACM
14 years 4 months ago
2010
ACM
We consider the following well-known problem, which is called the edge-disjoint paths problem. Input: A graph G with n vertices and m edges, k pairs of vertices (s1, t1), (s2, t2)...
DAM
2000
13 years 7 months ago
2000
The linear-width of a graph G is de ned to be the smallest integer k such that the edges of G can be arranged in a linear ordering e1;:::;er in such a way that for every i = 1;:::...
APPROX
2010
Springer
13 years 9 months ago
2010
Springer
We present a simple factor 6 algorithm for approximating the optimal multiplicative distortion of embedding (unweighted) graph metrics into tree metrics (thus improving and simplif...
WG
2007
Springer
14 years 1 months ago
2007
Springer
In the Planar +k vertex problem the task is to find at most k vertices whose deletion makes the given graph planar. The graphs for which there exists a solution form a minor close...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...