Concepedia

Diameter Computation Algorithms

Diameter Computation Algorithms is a class of graph-theoretic algorithms designed to determine the longest shortest path between any two vertices in a network, distinguishing itself by specifically quantifying the network's diameter through systematic exploration of pairwise distances.

219

Publications

7.4K

Citations

412

Authors

246

Institutions

Publications per year

2017–2026

19

Parents

Publications

219

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

Diameters and eigenvalues

Fan Chung · Journal of the American Mathematical Society · 1989 · 265 citations · Full text

, , +11

The Diameter of a Cycle Plus a Random Matching

B Bollobás, Fan Chung · SIAM Journal on Discrete Mathematics · 1988 · 181 citations

, , +10

On the diameter and girth of a zero-divisor graph

David F. Anderson, S. B. Mulay · Journal of Pure and Applied Algebra · 2006 · 158 citations

, , +9

A Design for Directed Graphs with Minimum Diameter

Imase, Itoh · IEEE Transactions on Computers · 1983 · 153 citations

, , +7

1–5 of 219

Authors

412

  1. FF
    Feodor F. Dragan

    Kent State University, United States

    6 publications · 292 citations

    6

    h-index

  2. SS
    Subhash Suri

    University of California, Santa Barbara, United States

    5 publications · 278 citations

    5

    h-index

  3. FW
    Frank W. Takes

    Leiden University, Netherlands

    4 publications · 146 citations

    4

    h-index

  4. FC
    Fan Chung

    University of California San Diego, United States

    4 publications · 475 citations

    4

    h-index

  5. MH
    Michel Habib

    Centre National de la Recherche Scientifique, France

    4 publications · 299 citations

    4

    h-index

1–5 of 412

Institutions

246

  1. Kent State University

    Kent, United States

    6 h-index

    7 publications

    294 citations

  2. University of Illinois Urbana-Champaign

    Urbana, United States

    5 h-index

    6 publications

    273 citations

  3. Stanford University

    Stanford, United States

    5 h-index

    10 publications

    1.6K citations

  4. Centre National de la Recherche Scientifique

    Paris, France

    4 h-index

    5 publications

    272 citations

  5. Université Paris Cité

    Paris, France

    4 h-index

    4 publications

    244 citations

  6. Tel Aviv University

    Tel Aviv, Israel

    4 h-index

    5 publications

    296 citations

  7. University of Waterloo

    Waterloo, Canada

    3 h-index

    7 publications

    132 citations

  8. Leiden University

    Leiden, The Netherlands

    3 h-index

    6 publications

    268 citations

1–8 of 246

Venues

  1. Discrete Applied Mathematics

    20 publications · 502 citations

    15

    h-index

  2. Discrete Mathematics

    13 publications · 290 citations

    11

    h-index

  3. Graphs and Combinatorics

    7 publications · 133 citations

    7

    h-index

  4. Information Processing Letters

    7 publications · 258 citations

    7

    h-index

  5. Journal of Graph Theory

    6 publications · 165 citations

    6

    h-index

1–5