Sciweavers

34 search results - page 7 / 7
» Minimum dilation stars
Sort
View
ALT
2010
Springer
15 years 1 months ago
Inferring Social Networks from Outbreaks
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...
Dana Angluin, James Aspnes, Lev Reyzin
82
Voted
STOC
2005
ACM
130views Algorithms» more  STOC 2005»
16 years 1 days ago
Low-distortion embeddings of general metrics into the line
A low-distortion embedding between two metric spaces is a mapping which preserves the distances between each pair of points, up to a small factor called distortion. Low-distortion...
Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasi...
89
Voted
DM
2008
103views more  DM 2008»
14 years 11 months ago
Edge-colorings avoiding rainbow and monochromatic subgraphs
For two graphs G and H, let the mixed anti-Ramsey numbers, maxR(n; G, H), (minR(n; G, H)) be the maximum (minimum) number of colors used in an edge-coloring of a complete graph wi...
Maria Axenovich, Perry Iverson
JGT
2010
158views more  JGT 2010»
14 years 10 months ago
Cubicity of interval graphs and the claw number
Let G(V, E) be a simple, undirected graph where V is the set of vertices and E is the set of edges. A b-dimensional cube is a Cartesian product I1 × I2 × · · · × Ib, where ea...
Abhijin Adiga, L. Sunil Chandran