Document Open Access Logo

Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331)

Authors George Karypis, Christian Schulz, Darren Strash, Deepak Ajwani, Rob H. Bisseling, Katrin Casel, Ümit V. Çatalyürek, Cédric Chevalier, Florian Chudigiewitsch, Marcelo Fonseca Faraj, Michael Fellows, Lars Gottesbüren, Tobias Heuer, Kamer Kaya, Jakub Lacki, Johannes Langguth, Xiaoye Sherry Li, Ruben Mayer, Johannes Meintrup, Yosuke Mizutani, François Pellegrini, Fabrizio Petrini, Frances Rosamond, Ilya Safro, Sebastian Schlag, Roohani Sharma, Blair D. Sullivan, Bora Uçar, Albert-Jan Yzelman and all authors of the abstracts in this report

PDF
Thumbnail PDF

File

DagRep.13.8.1.pdf
  • Filesize: 2.91 MB
  • 45 pages

Document Identifiers

Author Details

George Karypis
  • University of Minnesota - Minneapolis, US
Christian Schulz
  • Universität Heidelberg, DE
Darren Strash
  • Hamilton College - Clinton, US
Deepak Ajwani
  • University College Dublin, IE
Rob H. Bisseling
  • Utrecht University, NL
Katrin Casel
  • Humboldt University Berlin, DE
Ümit V. Çatalyürek
  • Georgia Institute of Technology - Atlanta, US & Amazon Web Services, US
Cédric Chevalier
  • CEA, DAM, DIF - Arpajon, FR
Florian Chudigiewitsch
  • Universität zu Lübeck, DE
Marcelo Fonseca Faraj
  • Universität Heidelberg, DE
Michael Fellows
  • University of Bergen, NO
Lars Gottesbüren
  • Karlsruher Institut für Technologie, DE
Tobias Heuer
  • Karlsruher Institut für Technologie, DE
Kamer Kaya
  • Sabanci University – Istanbul, TR
Jakub Lacki
  • Google - New York, US
Johannes Langguth
  • Simula Research Laboratory - Oslo, NO & University of Bergen, NO
Xiaoye Sherry Li
  • Lawrence Berkeley National Laboratory, US
Ruben Mayer
  • Universität Bayreuth, DE
Johannes Meintrup
  • Technische Hochschule Mittelhessen - Gießen, DE
Yosuke Mizutani
  • University of Utah – Salt Lake City, US
François Pellegrini
  • University of Bordeaux, FR
Fabrizio Petrini
  • Intel Labs - Menlo Park, US
Frances Rosamond
  • University of Bergen, NO
Ilya Safro
  • University of Delaware - Newark, US
Sebastian Schlag
  • Sunnyvale, US
Roohani Sharma
  • MPI für Informatik - Saarbrücken, DE
Blair D. Sullivan
  • University of Utah - Salt Lake City, US
Bora Uçar
  • CNRS and LIP ENS de Lyon, FR
Albert-Jan Yzelman
  • Huawei Technologies - Zürich, CH
and all authors of the abstracts in this report

Funding

  • Ajwani, Deepak: Supported in part by a grant from Science Foundation Ireland under Grant number 18/CRT/6183.
  • Meintrup, Johannes: Funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) – 379157101.

Cite AsGet BibTex

George Karypis, Christian Schulz, Darren Strash, Deepak Ajwani, Rob H. Bisseling, Katrin Casel, Ümit V. Çatalyürek, Cédric Chevalier, Florian Chudigiewitsch, Marcelo Fonseca Faraj, Michael Fellows, Lars Gottesbüren, Tobias Heuer, Kamer Kaya, Jakub Lacki, Johannes Langguth, Xiaoye Sherry Li, Ruben Mayer, Johannes Meintrup, Yosuke Mizutani, François Pellegrini, Fabrizio Petrini, Frances Rosamond, Ilya Safro, Sebastian Schlag, Roohani Sharma, Blair D. Sullivan, Bora Uçar, and Albert-Jan Yzelman. Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331). In Dagstuhl Reports, Volume 13, Issue 8, pp. 1-45, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/DagRep.13.8.1

Abstract

This report documents the program and the outcomes of Dagstuhl Seminar 23331 "Recent Trends in Graph Decomposition", which took place from 13. August to 18. August, 2023. The seminar brought together 33 experts from academia and industry to discuss graph decomposition, a pivotal technique for handling massive graphs in applications such as social networks and scientific simulations. The seminar addressed the challenges posed by contemporary hardware designs, the potential of deep neural networks and reinforcement learning in developing heuristics, the unique optimization requirements of large sparse data, and the need for scalable algorithms suitable for emerging architectures. Through presentations, discussions, and collaborative sessions, the event fostered an exchange of innovative ideas, leading to the creation of community notes highlighting key open problems in the field.

Subject Classification

ACM Subject Classification
  • Theory of computation → Design and analysis of algorithms
Keywords
  • combinatorial optimization
  • experimental algorithmics
  • parallel algorithms

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact