1327 search results - page 198 / 266 » Path following algorithm for the graph matching problem |
95
Voted
ICALP
2010
Springer
15 years 6 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) ...
152
click to vote
PODC
2006
ACM
15 years 7 months ago
2006
ACM
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
149
click to vote
TWC
2008
15 years 1 months ago
2008
A novel framework was introduced recently for stochastic routing in wireless multihop networks, whereby each node selects a neighbor to forward a packet according to a probability...
130
click to vote
APPROX
2011
Springer
14 years 1 months ago
2011
Springer
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
85
Voted
INFOCOM
2002
IEEE
15 years 6 months ago
2002
IEEE
— High-aggregate bandwidth switches are those whose port count multiplied by the operating line rate is very high; for example, a 30 port switch operating at 40 Gbps or a 1000 po...