1538 search results - page 173 / 308 » Spectral Techniques in Graph Algorithms |
128
click to vote
ECBS
2003
IEEE
15 years 9 months ago
2003
IEEE
We present an algebraic framework for evidence exploration: the process of interpreting, manipulating, and navigating the proof structure or evidence produced by a model checker w...
120
click to vote
SIAMDM
2010
15 years 2 months ago
2010
We consider the class of max-min and min-max optimization problems subject to a global budget (or weight) constraint and we undertake a systematic algorithmic and complexitytheore...
152
click to vote
WDAG
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We adapt the compact routing scheme by Thorup and Zwick to optimize it for power-law graphs. We analyze our adapted routing scheme based on the theory of unweighted rando...
135
click to vote
CIKM
2008
Springer
15 years 5 months ago
2008
Springer
In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...
103
click to vote
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—We study the distributed desynchronization problem for graphs with arbitrary topology. Motivated by the severe computational limitations of sensor networks, we present a randomi...