306 search results - page 39 / 62 » Computing the Girth of a Planar Graph |
GMP
2010
IEEE
14 years 14 days ago
2010
IEEE
Abstract. Semi-algebraic sets occur naturally when dealing with implicit models and boolean operations between them. In this work we present an algorithm to efficiently and in a ce...
WG
2001
Springer
14 years 1 days ago
2001
Springer
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...
ESA
2003
Springer
14 years 26 days ago
2003
Springer
This paper presents a dynamic algorithm for the construction of the Euclidean Voronoi diagram of a set of convex objects in the plane. We consider first the Voronoi diagram of smo...
WG
1995
Springer
13 years 11 months ago
1995
Springer
Abstract. In this paper, we investigate which processor networks allow klabel Interval Routing Schemes, under the assumption that costs of edges may vary. We show that for each xed...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...