2503 search results - page 326 / 501 » A study of 3-arc graphs |
154
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Motivated by applications in social networks, peer-to-peer and overlay networks, we define and study the Bounded Budget Connection (BBC) game - we have a collection of n players o...
131
click to vote
ECP
1997
Springer
15 years 10 months ago
1997
Springer
During the planning process, a planner may have many options for refinements to perform on the plan being developed. The planner’s efficiency depends on how it chooses which ref...
167
click to vote
CIAC
2006
Springer
15 years 9 months ago
2006
Springer
The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...
135
click to vote
SIROCCO
2010
15 years 7 months ago
2010
Abstract. This paper concerns graph spanners that approximate multipaths between pair of vertices of an undirected graphs with n vertices. Classically, a spanner H of stretch s for...
181
click to vote
GG
2008
Springer
15 years 7 months ago
2008
Springer
The model-driven development of model transformations requires both a technique to model model transformations as well as a means to transform transformation models. Therefore, t...