SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Discrete & Computational Geometry

Volumn 9, Issue 1, 1993, Pages 81-100

On sparse spanners of weighted graphs

(5) Althöfer, Ingo a Das, Gautam b Dobkin, David c Joseph, Deborah d Soares, José e,f

a BIELEFELD UNIVERSITY (Germany)

b UNIVERSITY OF MEMPHIS (United States)

c PRINCETON UNIVERSITY (United States)

d UNIVERSITY OF WISCONSIN MADISON (United States)

e UNIVERSITY OF SÃO PAULO (Brazil)

f UNIVERSITY OF CHICAGO (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039227987 PISSN: 01795376 EISSN: 14320444 Source Type: Journal
DOI: 10.1007/BF02189308 Document Type: Article

Times cited : (584)

References (26)

1
- 0008659928
- On Optimal Realizations of Finite Metric Spaces by Graphs
- (1988) Discrete Comput. Geom. , vol.3 , pp. 103-122
- Althöfer, I.¹

2
- 84936700332
- B. Awerbuch, Complexity of Network Synchronization, J. Assoc. Comput. Mach. (1985), 804–823.

3
- 84936700341
- B. Awerbuch, D. Bar-Noy, N. Linial, D. Peleg, Compact Distributed Data Structures for Adaptive Routing, Proc. STOC, 1989, pp. 479–489.

4
- 84936699923
- B. Awerbuch, D. Peleg, Routing with Polynomial Communication-Space Tradeoff, SIAM J. Discrete Math., to appear.

5
- 0000673494
- Reconstructing the Shape of a Tree from Observed Dissimilarity Data
- (1986) Adv. in Appl. Math. , vol.7 , pp. 309-343
- Bandelt, H.J.¹ Dress, A.W.M.²

6
- 84936699927
- M. Bern, Private Communication to David Dobkin, 1989.

7
- 0004200084
- Academic Press, New York
- (1978) Extremal Graph Theory
- Bollobás, B.¹

8
- 84936699926
- L. P. Chew, There is a Planar Graph Almost as Good as the Complete Graph, Proc. ACM Symp. on Computational Geometry, 1986, pp. 169–177.

9
- 0003643241
- Springer-Verlag, New York
- (1988) Sphere Packing, Lattices, and Groups
- Conway, J.H.¹ Sloane, N.J.A.²

10
- 0001481555
- Trees, Tight Extensions of Metric Spaces
- (1984) Adv. in Math. , vol.53 , pp. 321-402
- Dress, A.W.M.¹

11
- 84936699925
- D. P. Dobkin, S. J. Friedman, K. J. Supowit, Delaunay Graphs Are Almost as Good as Complete Graphs, Proc. FOCS, 1987, pp. 20–26.

12
- 84936699924
- G. Das, D. A. Joseph, Which Triangulations Approximate the Complete Graph?, Proc. Internat. Symp. on Optimal Algorithms, 1989, pp. 168–192, LNCS, Vol. 401, Springer-Verlag, Berlin.

13
- 0000471093
- Reguläre Graphen gegebener Taillenweite mit minimaler Knotenzahl
- (1963) Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg Math.-Natur. Reihe , vol.12 , pp. 251-257
- Erdös, P.¹ Sachs, H.²

14
- 85032193610
- Approximating the Complete Euclidean Graph
- Springer-Verlag, Berlin
- (1988) Proc. SWAT , pp. 208-213
- Keil, J.M.¹

15
- 84976713672
- Springer-Verlag, Berlin
- (1989) The Delaunay Triangulation Closely Approximates the Complete Euclidean Graph, Proc. WADS , pp. 47-56
- Keil, J.M.¹ Gutwin, C.A.²

16
- 84936684131
- Proc. Internat. Symp. on Optimal Algorithms, Springer-Verlag, Berlin
- (1989) There Are Planar Graphs Almost as Good as the Complete Graphs and as Short as Minimum Spanning Trees , pp. 9-13
- Levcopoulos, C.¹ Lingas, A.²

17
- 0037904601
- Regular d-valent Graphs of Girth 6 and 2(d* d−d+1) Vertices
- (1970) J. Combin. Theory , vol.9 , pp. 420-422
- Longyear, J.¹

18
- 0000848816
- Ramanujan Graphs
- (1988) Combinatorica , vol.8 , Issue.3 , pp. 261-277
- Lubotzky, A.¹ Phillips, R.² Sarnak, P.³

19
- 0024045909
- Explicit Group-Theoretical Constructions of Combinatorial Schemes and Their Application to the Design of Expanders and Concentrators
- (1988) Problems Inform. Transmission , vol.24 , Issue.1 , pp. 39-46
- Margulis, G.A.¹

20
- 0002499613
- Graph Spanners
- (1989) Journal of Graph Theory , vol.13 , Issue.1 , pp. 99-116
- Peleg, D.¹ Schäffer, A.²

21
- 0024715435
- An Optimal Synchronizer for the Hypercube
- (1989) SIAM J. Comput. , vol.18 , pp. 740-747
- Peleg, D.¹ Ullman, J.²

22
- 84936699930
- P. Peleg, E. Upfal, A Tradeoff Between Space and Efficiency for Routing Tables, Proc. STOC, 1988, pp. 43–52.

23
- 84936653390
- Springer-Verlag, Berlin
- (1989) Memory Versus Randomness in Online Algorithms, Proc. ICALP , pp. 687-703
- Raghaven, P.¹ Snir, M.²

24
- 52449147619
- Shortest Paths in Euclidean Graphs
- (1986) Algorithmica , vol.1 , pp. 31-48
- Sedgewick, R.¹ Vitter, J.S.²

25
- 0000503301
- A Note on the Tree Realizability of a Distance Matrix
- (1969) Journal of Combinatorial Theory , vol.6 , pp. 303-310
- Simões-Pereira, J.M.S.¹

26
- 0004190201
- Society for Industrial and Applied Mathematics, Philadelphia, PA
- (1983) Data Structures and Network Algorithms
- Tarjan, R.E.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.