641 search results - page 48 / 129 » On Planar Quasi-Parity Graphs |
137
click to vote
WG
2007
Springer
16 years 6 days ago
2007
Springer
For a 3-colourable graph G, the 3-colour graph of G, denoted C3(G), is the graph with node set the proper vertex 3-colourings of G, and two nodes adjacent whenever the correspondi...
160
click to vote
SODA
2000
ACM
15 years 7 months ago
2000
ACM
We give nontrivial bounds for the inductiveness or degeneracy of power graphs Gk of a planar graph G. This implies bounds for the chromatic number as well, since the inductiveness ...
158
click to vote
ESA
2003
Springer
15 years 11 months 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...
172
click to vote
GMP
2010
IEEE
15 years 11 months 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...
172
click to vote
STACS
2010
Springer
16 years 1 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( ...