메뉴 건너뛰기




Volumn 28, Issue 1, 1998, Pages 210-236

Fast algorithms for constructing t-spanners and paths with stretch t

Author keywords

Graph spanners; Parallel algorithms; Shortest paths

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; PARALLEL ALGORITHMS; PROBLEM SOLVING;

EID: 0032057899     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539794261295     Document Type: Article
Times cited : (152)

References (15)
  • 5
    • 0000182415 scopus 로고
    • A measure of the asymptotic efficiency for test of a hypothesis based on the sum of observations
    • H. CHERNOFF, A measure of the asymptotic efficiency for test of a hypothesis based on the sum of observations, Ann. Math. Statist., 23 (1952), pp. 493-509.
    • (1952) Ann. Math. Statist. , vol.23 , pp. 493-509
    • Chernoff, H.1
  • 7
    • 0028076569 scopus 로고
    • Polylog-time and near-linear work approximation scheme for undirected shortest-paths
    • Association for Computing Machinery, New York
    • E. COHEN, Polylog-time and near-linear work approximation scheme for undirected shortest-paths, in Proc. 26th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, 1994, pp. 16-26.
    • (1994) Proc. 26th Annual ACM Symposium on Theory of Computing , pp. 16-26
    • Cohen, E.1
  • 10
    • 0026966836 scopus 로고
    • A parallel randomized approximation scheme for shortest paths
    • Association for Computing Machinery, New York
    • P. N. KLEIN AND S. SAIRAM, A parallel randomized approximation scheme for shortest paths, in Proc. 24th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, 1992, pp. 750-758.
    • (1992) Proc. 24th Annual ACM Symposium on Theory of Computing , pp. 750-758
    • Klein, P.N.1    Sairam, S.2
  • 12
    • 0024715435 scopus 로고
    • An optimal synchronizer for the hypercube
    • D. PELEG AND J. D. ULLMAN, An optimal synchronizer for the hypercube, SIAM J. Comput., 18 (1989), pp. 740-747.
    • (1989) SIAM J. Comput. , vol.18 , pp. 740-747
    • Peleg, D.1    Ullman, J.D.2
  • 13
    • 0347011631 scopus 로고
    • More time-work tradeoffs for parallel graph algorithms
    • Association for Computing Machinery, New York
    • T. H. SPENCER, More time-work tradeoffs for parallel graph algorithms, in Proc. 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, Association for Computing Machinery, New York, 1991, pp. 81-93.
    • (1991) Proc. 3rd Annual ACM Symposium on Parallel Algorithms and Architectures , pp. 81-93
    • Spencer, T.H.1
  • 14
    • 0026102973 scopus 로고
    • High-probability parallel transitive closure algorithms
    • J. D. ULLMAN AND M. YANNAKAKIS, High-probability parallel transitive closure algorithms, SIAM J. Comput., 20 (1991), pp. 100-125.
    • (1991) SIAM J. Comput. , vol.20 , pp. 100-125
    • Ullman, J.D.1    Yannakakis, M.2
  • 15
    • 1542476396 scopus 로고
    • personal communication
    • D. R. KARGER, personal communication, 1993.
    • (1993)
    • Karger, D.R.1


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