3008 search results - page 261 / 602 » Independence in connected graphs |
197
click to vote
RSA
2011
15 years 1 months ago
2011
We study the cover time of random geometric graphs. Let I(d) = [0, 1]d denote the unit torus in d dimensions. Let D(x, r) denote the ball (disc) of radius r. Let Υd be the volume...
275
click to vote
ICALP
2011
Springer
14 years 10 months ago
2011
Springer
Given an unlabeled, unweighted, and undirected graph with n vertices and small (but not necessarily constant) treewidth k, we consider the problem of preprocessing the graph to bui...
209
click to vote
APN
2007
Springer
16 years 26 days ago
2007
Springer
Asynchronous data communication mechanisms (ACMs) have been extensively studied as data connectors between independently timed concurrent processes. In previous work, an automatic ...
177
click to vote
MFCS
1997
Springer
15 years 10 months ago
1997
Springer
We prove an exponential lower bound for the length of any resolution proof for the same set of clauses as the one used by Urquhart [13]. Our contribution is a significant simpli...
186
click to vote
PLDI
1993
ACM
15 years 10 months ago
1993
ACM
Program analysis and optimizationcan be speeded upthrough the use of the dependence flow graph (DFG), a representation of program dependences which generalizes def-use chains and...