1172 search results - page 24 / 235 » Path Algorithms on Regular Graphs |
ESA
2003
Springer
14 years 27 days ago
2003
Springer
APPROX
2004
Springer
14 years 1 months ago
2004
Springer
Given any integer d ≥ 3, let k be the smallest integer such that d < 2k log k. We prove that with high probability the chromatic number of a random d-regular graph is k, k + 1...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
— We present new combinatorial algorithms for Boolean matrix multiplication (BMM) and preprocessing a graph to answer independent set queries. We give the first asymptotic impro...
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— We propose efficient distributed algorithms to aid navigation of a user through a geographic area covered by sensors. The sensors sense the level of danger at their locations ...
VLDB
2005
ACM
14 years 1 months ago
2005
ACM
Existing work for query processing over graph data models often relies on pre-computing the transitive closure or path indexes. In this paper, we propose a family of stack-based a...