13 search results - page 2 / 3 » Planar embeddability of the vertices of a graph using a fixe... |
IWPEC
2009
Springer
13 years 11 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...
COMPGEOM
2010
ACM
13 years 10 months ago
2010
ACM
We study the expected number of interior vertices of degree i in a triangulation of a point set S, drawn uniformly at random from the set of all triangulations of S, and derive va...
ICALP
2009
Springer
14 years 5 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
SIAMCOMP
2000
13 years 4 months ago
2000
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Schnyder woods are decompositions of simple triangulations into three edge-disjoint spanning trees crossing each other in a specific way. In this article, we define a generalizatio...