Online Graph Algorithms

Online Graph Algorithms is a class of computational procedures that process and make irreversible decisions about graph-theoretic problems in sequential input regimes where the complete instance is not known in advance, distinguishing itself from offline graph algorithms by requiring immediate responses to incremental graph data without future lookahead.

181

Publications

8.8K

Citations

417

Authors

187

Institutions

Publications per year

2017–2026

54

Authors

417

  1. ZH
    Zhiyi Huang

    University of Hong Kong, Hong Kong SAR China

    8 publications · 258 citations

    8

    h-index

  2. ZG
    Zhihao Gavin Tang

    University of Hong Kong, Hong Kong SAR China

    6 publications · 232 citations

    6

    h-index

  3. DS
    Danny Segev

    Tel Aviv University, Israel

    6 publications · 184 citations

    6

    h-index

  4. YZ
    Yuhao Zhang

    University of Hong Kong, Hong Kong SAR China

    5 publications · 212 citations

    5

    h-index

  5. JN
    Joseph Naor

    Technion – Israel Institute of Technology, Israel

    5 publications · 277 citations

    5

    h-index

1–5 of 417

Venues

  1. arXiv (Cornell University)

    Repository · 8 publications · 222 citations

    8

    h-index

  2. Proceedings of the VLDB Endowment

    PVLDB · 6 publications · 422 citations

    6

    h-index

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

    Repository · 5 publications · 118 citations

    5

    h-index

  4. ACM Transactions on Algorithms

    TALG · 5 publications · 285 citations

    5

    h-index

  5. Theoretical Computer Science

    5 publications · 594 citations

    5

    h-index

1–5