307 search results - page 8 / 62 » Low-Distortion Embeddings of Trees |
SWAT
1994
Springer
13 years 11 months ago
1994
Springer
We present sequential and parallel algorithms for various embedding problems on bounded degree partial k-trees and k-connected partial k-trees these include subgraph isomorphism a...
APPROX
2010
Springer
13 years 9 months ago
2010
Springer
We present a simple factor 6 algorithm for approximating the optimal multiplicative distortion of embedding (unweighted) graph metrics into tree metrics (thus improving and simplif...
IPCV
2008
13 years 9 months ago
2008
Video streaming over the Internet has gained popularity during recent years mainly due to the revival of videoconferencing and videotelephony applications and the proliferation of ...
JSYML
2008
13 years 7 months ago
2008
An important technique in large cardinal set theory is that of extending an elementary embedding j : M N between inner models to an elementary embedding j : M[G] N[G] between ge...
COMBINATORICA
2007
13 years 7 months ago
2007
We derive a sufficient condition for a sparse graph G on n vertices to contain a copy of a tree T of maximum degree at most d on (1 − )n vertices, in terms of the expansion prop...