829 search results - page 45 / 166 » Distance domination-critical graphs |
120
click to vote
SWAT
1994
Springer
15 years 3 months ago
1994
Springer
A graph is distance-hereditary if and only if each cycle on five or more vertices has at least two crossing chords. We present linear time algorithms for the minimum r-dominating c...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
The packing chromatic number (G) of a graph G is the least integer k for which there exists a mapping f from V (G) to {1, 2, . . ., k} such that any two vertices of color i
CAE
2007
15 years 2 months ago
2007
We present a stipple placement method which provides extra emphasis to image features, especially edges. Our algorithm transforms an image into a regular graph, with edge weights ...
APPROX
2006
Springer
15 years 3 months ago
2006
Springer
DAGSTUHL
2006
15 years 1 months ago
2006
