36 search results - page 4 / 8 » Independence Free Graphs and Vertex Connectivity Augmentatio... |
121
click to vote
ESA
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edge-weighted undirected planar graphs that are re...
112
click to vote
SODA
2008
ACM
15 years 3 months ago
2008
ACM
Given a point set P in the plane, the Delaunay graph with respect to axis-parallel rectangles is a graph defined on the vertex set P, whose two points p, q P are connected by an ...
122
Voted
COMBINATORICA
2006
15 years 1 months ago
2006
We introduce and discuss generalizations of the problem of independent transversals. Given a graph property R, we investigate whether any graph of maximum degree at most d with a ...
115
click to vote
COMGEO
2008
ACM
15 years 1 months ago
2008
ACM
Consider a planar straight line graph (PSLG), G, with k connected components, k 2. We show that if no component is a singleton, we can always find a vertex in one component that s...
121
click to vote
ESA
2006
Springer
15 years 5 months ago
2006
Springer
We consider the following vertex coloring problem. We are given an undirected graph G = (V, E), where each vertex v is associated with a penalty rejection cost rv. We need to choos...