4865 search results - page 839 / 973 » The Complexity of Graph Connectivity |
WAIM
2007
Springer
15 years 4 months ago
2007
Springer
The HITS algorithm proposed by Kleinberg is one of the representative methods of scoring Web pages by using hyperlinks. In the days when the algorithm was proposed, most of the pag...
101
click to vote
WIOPT
2006
IEEE
15 years 4 months ago
2006
IEEE
— This paper develops a novel color-based broadcast scheme for wireless ad hoc networks where each forwarding of the broadcast message is assigned a color from a given pool of co...
ISSTA
2006
ACM
15 years 4 months ago
2006
ACM
This paper presents a specification-based testing approach that compares software specifications defined at different f abstraction, e.g. architecture and implementation, agai...
ISAAC
2004
Springer
15 years 3 months ago
2004
Springer
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
MIDDLEWARE
2004
Springer
15 years 3 months ago
2004
Springer
Simulation studies are frequently used to evaluate new peer-to-peer searching techniques as well as existing techniques on new applications. Unless these studies are accurate in th...