266 search results - page 23 / 54 » Graphs with Bounded Induced Distance |
147
Voted
COMBINATORICS
2006
15 years 5 months ago
2006
A set M of edges of a graph G is a matching if no two edges in M are incident to the same vertex. The matching number of G is the maximum cardinality of a matching of G. A set S o...
175
click to vote
ALT
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Assume we are given a sample of points from some underlying distribution which contains several distinct clusters. Our goal is to construct a neighborhood graph on the sa...
143
Voted
WADS
2005
Springer
15 years 10 months ago
2005
Springer
Let G be an embedded planar graph whose edges may be curves. The detour between two points, p and q (on edges or vertices) of G, is the ratio between the shortest path in G between...
144
click to vote
ECCC
2008
15 years 4 months ago
2008
Given a function f : {0, 1}n {0, 1}, let M (f) denote the smallest distance between f and a monotone function on {0, 1}n . Let M (f) denote the fraction of hypercube edges where f...
156
click to vote
SPAA
2006
ACM
15 years 11 months ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...