450 search results - page 3 / 90 » Quadrangulations of Planar Sets |
CCCG
2003
13 years 8 months ago
2003
We pose a monotonicity conjecture on the number of pseudo-triangulations of any planar point set, and check it on two prominent families of point sets, namely the so-called double...
TAMC
2009
Springer
14 years 1 months ago
2009
Springer
We provide polynomial time data reduction rules for Connected Dominating Set in planar graphs and analyze these to obtain a linear kernel for the planar Connected Dominating Set pr...
GC
2010
Springer
13 years 5 months ago
2010
Springer
In 1966 Barnette introduced a set of graphs, called circuit graphs, which are obtained from 3-connected planar graphs by deleting a vertex. Circuit graphs and 3-connected planar g...
CCCG
2007
13 years 8 months ago
2007
We analyze the minimum and maximum number of empty pseudo-triangles defined by any planar point set. We consider the cases where the three convex vertices are fixed and where th...
IWPEC
2009
Springer
14 years 1 months ago
2009
Springer
![Planar Capacitated Dominating Set Is W[1]-Hard](https://www.sciweavers.org/files/imagecache/thumbnail/default/content.jpg "Planar Capacitated Dominating Set Is W[1]-Hard")
Given a graph G together with a capacity function c : V (G) → N, we call S ⊆ V (G) a capacitated dominating set if there exists a mapping f : (V (G) \ S) → S which maps every...