Distance realization problems with applications to internet tomography

Journal of Computer and System Sciences

Volumn 63, Issue 3, 2001, Pages 432-448

  Chung, Fan ^a,b   Garrett, Mark ^b   Graham, Ronald ^a   Shallcross, David ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b TELCORDIA TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOUNDARY CONDITIONS; COMPUTERIZED TOMOGRAPHY; DATA STRUCTURES; GRAPH THEORY; INTERNET; MATRIX ALGEBRA; OPTIMIZATION; SET THEORY;

DISTANCE REALIZATION PROBLEMS; GRAPH OPTIMIZATION PROBLEMS; INTERNET DATA TRAFFIC MODELS; INTERNET TOMOGRAPHY; WEAK REALIZATION PROBLEM;

COMPUTATIONAL COMPLEXITY;

EID: 0035521411     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.2001.1785     Document Type: Article

References (33)

1. A random graph model for massive graphs
2. On optimal realizations of finite metric spaces by graphs
3. Recognition of tree metrics
4. A technique for measuring the relative size and overlap of public web search engines
5. An almost linear-time algorithm for graph realization
6. Properties of the distance matrix of a tree
7. Modeling internet topology
8. On graphs which contain all small trees
9. On universal graphs
10. On universal graphs for spanning trees
11. Universal graphs and induced universal graphs
12. Internet tomography
13. What's next for internet data analysis?
14. A fast algorithm for constructing trees from distance matrices
15. Fast parallel recognition of ultrametrics and tree metrics
16. Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
17. An efficient PQ-graph algorithm for solving the graph realization problem
18. Improved approximation algorithms for maximum cut and satisfiability problem using semidefinite programming
19. Distance matrix of a graph and its realizability
20. The Steiner problem
21. Exploring large graphs in 3D hyperbolic space
22. Realizing the distance matrix of a graph
23. The distance matrix of a graph and its realization
24. A note on the tree realizability of a distance matrix
25. An algorithm and its role in the study of optimal graph realizations of distance matrices
26. An optimality criterion for graph embeddings of metrics
27. Submatrices of non-tree-realizable distance matrices
28. Diagnosing the Internet's ills
29. A homotopy theorem for matroids, I, II
30. An algorithm for determining whether a given binary matroid is graphic