1756 search results - page 260 / 352 » Directed scale-free graphs |
106
click to vote
SPAA
2005
ACM
15 years 6 months ago
2005
ACM
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
106
click to vote
PLDI
2004
ACM
15 years 6 months ago
2004
ACM
Regular path queries are a way of declaratively expressing queries on graphs as regular-expression-like patterns that are matched against paths in the graph. There are two kinds o...
102
Voted
GECCO
2004
Springer
15 years 6 months ago
2004
Springer
The prize-collecting Steiner tree problem on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus th...
117
click to vote
ISAAC
2004
Springer
15 years 6 months ago
2004
Springer
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...
121
Voted
KR
2004
Springer
15 years 6 months ago
2004
Springer
In this paper, partial knowledge about the possible transitions which can take place in a dynamical environment is represented by a set of pairs of propositional formulae, with th...