4865 search results - page 621 / 973 » The Complexity of Graph Connectivity |
190
click to vote
INFOCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
—Recently proposed beaconless georouting algorithms are fully reactive, with nodes forwarding packets without prior knowledge of their neighbors. However, existing approaches for...
203
click to vote
ISAAC
2007
Springer
16 years 28 days ago
2007
Springer
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
263
Voted
BMCBI
2010
15 years 6 months ago
2010
Background: Several tools have been developed to explore and search Gene Ontology (GO) databases allowing efficient GO enrichment analysis and GO tree visualization. Nevertheless,...
213
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Nowadays modern biology aims at unravelling the strands of complex biological structures such as the protein-protein interaction (PPI) networks. A key concept in the o...
219
click to vote
ICDE
2012
IEEE
13 years 9 months ago
2012
IEEE
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...