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
Parents
181
On graph problems in a semi-streaming model
Joan Feigenbaum, Sampath Kannan, Andrew McGregor et al. · Theoretical Computer Science · 2005 · 422 citations
Optimal hierarchical decompositions for congestion minimization in networks
Harald Räcke · 2008 · 293 citations
Online Stochastic Matching: Beating 1-1/e
Jon Feldman, Aranyak Mehta, Vahab Mirrokni et al. · 2009 · 273 citations
1–5 of 181
417
8
h-index
6
h-index
6
h-index
5
h-index
5
h-index
1–5 of 417
187
Technion – Israel Institute of Technology
Haifa, Israel
12 h-index
25 publications
1.2K citations

University of Hong Kong
Pok Fu Lam, Hong Kong
12 h-index
24 publications
1K citations
Carnegie Mellon University
Pittsburgh, United States
9 h-index
18 publications
1.4K citations
Google (United States)
Mountain View, United States
9 h-index
24 publications
1.7K citations
Massachusetts Institute of Technology
Cambridge, United States
8 h-index
11 publications
871 citations
University of Haifa
Haifa, Israel
7 h-index
11 publications
282 citations
ETH Zurich
Zurich, Switzerland
6 h-index
9 publications
255 citations
Shanghai University of Finance and Economics
Shanghai, China
6 h-index
7 publications
212 citations
1–8 of 187
Repository · 8 publications · 222 citations
8
h-index
PVLDB · 6 publications · 422 citations
6
h-index
Repository · 5 publications · 118 citations
5
h-index
TALG · 5 publications · 285 citations
5
h-index
5 publications · 594 citations
5
h-index
1–5