1986 search results - page 271 / 398 » Path Separability of Graphs |
102
click to vote
ICALP
2010
Springer
15 years 7 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) ...
115
click to vote
CORR
2004
Springer
15 years 2 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...
104
click to vote
DM
1998
15 years 2 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)+...
118
click to vote
MP
2007
15 years 2 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...
111
Voted
CVPR
2007
IEEE
16 years 4 months ago
2007
IEEE
We propose a method for simultaneous detection, localization and segmentation of objects of a known category. We show that this is possible by using segments as features. To this ...