Cross-Paradigm Graph Algorithms (Invited Talk)

Author Danupon Nanongkai

Thumbnail PDF


  • Filesize: 350 kB
  • 1 pages

Document Identifiers

Author Details

Danupon Nanongkai
  • Max Planck Institute for Informatics, Saarland Informatics Campus, Saarbrücken, Germany
  • KTH Royal Institute of Technology, Stockholm, Sweden

Cite AsGet BibTex

Danupon Nanongkai. Cross-Paradigm Graph Algorithms (Invited Talk). In 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 297, p. 3:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)


A goal of the theory of graph algorithms is algorithmic techniques that enable computing devices to process graph data with little resources (time, space, communication overhead, etc.). This led to extensive studies of graph algorithms in various models of computation (sequential algorithms, distributed algorithms, streaming algorithms, etc.) by many sub-communities. Cross-paradigm graph algorithms is an effort to attack the same problem in many models of computation simultaneously, with the goal to generate new insights that may not emerge from the isolated viewpoint of a single model and to ultimately develop techniques that can be used to solve graph problems near-optimally across many models of computation. In this talk, I will discuss some recent advances in graph algorithmic techniques for basic graph problems (e.g. minimum cut, shortest path, and maximum flow) in connection to this research program, especially some insights that led to cross-paradigm algorithms and to answering notorious open questions. No background will be assumed from the audience beyond familiarity with textbook graph algorithms.

Subject Classification

ACM Subject Classification
  • Theory of computation → Graph algorithms analysis
  • Theory of computation → Models of computation
  • Graph Algorithms and Complexity
  • Efficient Algorithms
  • Models of Computation


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads