721 search results - page 106 / 145 » Bounds on the k-domination number of a graph |
169
click to vote
ICALP
2000
Springer
15 years 9 months ago
2000
Springer
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...
146
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
158
click to vote
NAACL
2007
15 years 7 months ago
2007
The task of selecting and ordering information appears in multiple contexts in text generation and summarization. For instance, methods for title generation construct a headline b...
155
click to vote
CONCUR
2010
Springer
15 years 7 months ago
2010
Springer
We study decision problems for parameterized verification of a formal model of Ad Hoc Networks with selective broadcast and spontaneous movement. The communication topology of a ne...
155
click to vote
TCS
2008
15 years 6 months ago
2008
We consider various well-known, equivalent complexity measures for graphs such as elimination orderings, k-trees and cops and robber games and study their natural translations to ...