Concepedia

Approximate Diameter

Approximate Diameter is an algorithmic metric in graph theory that estimates the longest shortest path between any pair of vertices in a network to within a specified factor or additive error, distinguishing itself from the exact diameter by trading precision for computational efficiency.

61

Publications

4.7K

Citations

150

Authors

73

Institutions

Publications per year

2017–2026

3

Parents

Publications

61

Molecular Borromean Rings

Kelly S. Chichak, Stuart Cantrill, Anthony R. Pease et al. · Science · 2004 · 812 citations

, , +16

Approximating extent measures of points

Pankaj K. Agarwal, Sariel Har-Peled, Kasturi Varadarajan · Journal of the ACM · 2004 · 360 citations

, , +14

Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)

D. Aingworth, Chandra Chekuri, Piotr Indyk et al. · SIAM Journal on Computing · 1999 · 337 citations

, , +16

A non‐micellar mode of cholesterol transport in human bile

Giora J. Sömjen, Tuvia Gilat · FEBS Letters · 1983 · 205 citations · Full text

, , +9

Fast approximation algorithms for the diameter and radius of sparse graphs

Liam Roditty, Virginia Vassilevska Williams · 2013 · 202 citations

, , +17

1–5 of 61

Authors

150

  1. SH
    Sariel Har-Peled

    University of Illinois Urbana-Champaign, United States

    5 publications · 521 citations

    5

    h-index

  2. SH
    Stephan Holzer

    ETH Zurich, Switzerland

    3 publications · 297 citations

    3

    h-index

  3. LR
    Liam Roditty

    Bar-Ilan University, Israel

    3 publications · 295 citations

    3

    h-index

  4. VV
    Virginia Vassilevska Williams

    Stanford University, United States

    3 publications · 295 citations

    3

    h-index

  5. RW
    Roger Wattenhofer

    ETH Zurich, Switzerland

    3 publications · 349 citations

    3

    h-index

1–5 of 150

Institutions

73

  1. ETH Zurich

    Zurich, Switzerland

    3 h-index

    6 publications

    696 citations

  2. Stanford University

    Stanford, United States

    3 h-index

    8 publications

    1.4K citations

  3. Tel Aviv University

    Tel Aviv, Israel

    3 h-index

    3 publications

    268 citations

  4. University of Illinois Urbana-Champaign

    Urbana, United States

    3 h-index

    3 publications

    458 citations

  5. Kent State University

    Kent, United States

    2 h-index

    3 publications

    259 citations

  6. Hewlett-Packard (United States)

    Palo Alto, United States

    2 h-index

    2 publications

    55 citations

  7. Bar-Ilan University

    Ramat Gan, Israel

    2 h-index

    3 publications

    270 citations

  8. University of Pisa

    Pisa, Italy

    2 h-index

    2 publications

    49 citations

1–8 of 73

Venues

  1. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 2 publications · 42 citations

    2

    h-index

  2. Symposium on Discrete Algorithms

    Conference · 2 publications · 71 citations

    2

    h-index

  3. Journal of the American Chemical Society

    JACS · 2 publications · 116 citations

    2

    h-index

  4. Journal of Graph Theory

    2 publications · 128 citations

    2

    h-index

  5. SIAM Journal on Computing

    2 publications · 380 citations

    2

    h-index

1–5