5889 search results - page 327 / 1178 » Graph Layout Problems |
186
click to vote
MST
2010
15 years 5 months ago
2010
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
194
click to vote
ISAAC
2009
Springer
15 years 11 months ago
2009
Springer
For a graph G and a collection of vertex pairs {(s1, t1), . . . , (sk, tk)}, the k disjoint paths problem is to find k vertex-disjoint paths P1, . . . , Pk, where Pi is a path fr...
192
click to vote
ICPR
2004
IEEE
16 years 7 months ago
2004
IEEE
Corner matching constitutes a fundamental vision problem that serves as a building block of several important applications. The common approach to dealing with this problem starts...
173
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
We study the Unsplittable Flow Problem (UFP) on a line graph, focusing on the long-standing open question of whether the problem is APX-hard. We describe a deterministic quasi-pol...
205
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...