Concepedia

Fully Dynamic Graph Algorithms

Fully Dynamic Graph Algorithms is a class of graph algorithms designed to efficiently maintain and query graph properties under arbitrary sequences of edge insertions and deletions, distinguishing it from incremental or decremental methods by supporting fully reversible dynamic updates.

137

Publications

6.6K

Citations

170

Authors

98

Institutions

Publications per year

2017–2026

39

Parents

Publications

137

Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity

Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup · Journal of the ACM · 2001 · 472 citations

, , +15

Randomized fully dynamic graph algorithms with polylogarithmic time per operation

Monika Henzinger, Valerie King · Journal of the ACM · 1999 · 285 citations · Full text

, , +14

A new approach to dynamic all pairs shortest paths

Camil Demetrescu, Giuseppe F. Italiano · Journal of the ACM · 2004 · 270 citations

, , +16

Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs

Valerie King · 2003 · 228 citations

, , +14

Near-optimal fully-dynamic graph connectivity

Mikkel Thorup · 2000 · 199 citations

, , +10

1–5 of 137

Authors

170

  1. GF
    Giuseppe F. Italiano

    University of Rome Tor Vergata, Italy

    15 publications · 938 citations

    15

    h-index

  2. MH
    Monika Henzinger

    University of Vienna, Austria

    16 publications · 849 citations

    13

    h-index

  3. SS
    Shay Solomon

    Ben-Gurion University of the Negev, Israel

    9 publications · 264 citations

    9

    h-index

  4. MT
    Mikkel Thorup

    AT&T (United States), United States

    8 publications · 964 citations

    8

    h-index

  5. SB
    Surender Baswana

    Indian Institute of Technology Kanpur, India

    8 publications · 268 citations

    8

    h-index

1–5 of 170

Institutions

98

  1. Tel Aviv University

    Tel Aviv, Israel

    11 h-index

    15 publications

    705 citations

  2. Sapienza University of Rome

    Rome, Italy

    10 h-index

    16 publications

    1.5K citations

  3. University of Copenhagen

    Copenhagen, Denmark

    9 h-index

    14 publications

    1.4K citations

  4. University of Vienna

    Vienna, Austria

    8 h-index

    15 publications

    353 citations

  5. University of Rome Tor Vergata

    Rome, Italy

    7 h-index

    10 publications

    808 citations

  6. Georgia Institute of Technology

    Atlanta, United States

    6 h-index

    11 publications

    306 citations

  7. University of Victoria

    Victoria, Canada

    6 h-index

    7 publications

    888 citations

  8. Indian Institute of Technology Kanpur

    Kanpur, India

    5 h-index

    12 publications

    511 citations

1–8 of 98

Venues

  1. SIAM Journal on Computing

    11 publications · 446 citations

    11

    h-index

  2. arXiv (Cornell University)

    Repository · 10 publications · 203 citations

    10

    h-index

  3. ACM Transactions on Algorithms

    TALG · 7 publications · 218 citations

    7

    h-index

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

    Repository · 6 publications · 99 citations

    6

    h-index

  5. Proceedings of the VLDB Endowment

    PVLDB · 5 publications · 194 citations

    5

    h-index

1–5