721 search results - page 56 / 145 » Bounds on the k-domination number of a graph |
141
click to vote
COCO
2007
Springer
16 years 11 days ago
2007
Springer
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...
154
click to vote
SIROCCO
2007
15 years 7 months ago
2007
We present the first location oblivious distributed unit disk graph coloring algorithm having a provable performance ratio of three (i.e. the number of colors used by the algorit...
175
click to vote
AUTOMATICA
2004
15 years 6 months ago
2004
This paper deals with feedback controller synthesis for timed event graphs in dioids, where the number of initial tokens and time delays are only known to belong to intervals. We ...
158
click to vote
COLT
2007
Springer
16 years 11 days ago
2007
Springer
We present a new class of problems, called resource-bounded information gathering for correlation clustering. Our goal is to perform correlation clustering under circumstances in w...
181
click to vote
GD
2004
Springer
15 years 11 months ago
2004
Springer
A k-stack layout (respectively, k-queue layout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges wi...