1447 search results - page 212 / 290 » Graphs and Path Equilibria |
146
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
We consider the problem of efficiently finding an additive C-spanner of an undirected unweighted graph G, that is, a subgraph H so that for all pairs of vertices u, v, δH (u, v) ...
163
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
Mapping the Internet generally consists in sampling the network from a limited set of sources by using traceroute-like probes. This methodology, akin to the merging of different s...
144
click to vote
DM
1998
15 years 6 months ago
1998
A tree function (TF) t on a ÿnite set X is a real function on the set of the pairs of elements of X satisfying the four-point condition: for all distinct x; y; z; w ∈ X; t(xy)+...
171
click to vote
MP
2007
15 years 5 months ago
2007
Given a graph with costs on the edges, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of the nodes of this graph...
154
click to vote
ICSE
2004
IEEE-ACM
16 years 6 months ago
2004
IEEE-ACM
Abstract. Building systems from existing applications written in two or more languages is common practice. Such systems are polylingual. Polylingual systems are relatively easy to ...