Open Problems in (Hyper)Graph Decomposition - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2023

Open Problems in (Hyper)Graph Decomposition

Jakub Lacki
  • Function : Author
Darren Strash
  • Function : Author

Abstract

Large networks are useful in a wide range of applications. Sometimes problem instances are composed of billions of entities. Decomposing and analyzing these structures helps us gain new insights about our surroundings. Even if the final application concerns a different problem (such as traversal, finding paths, trees, and flows), decomposing large graphs is often an important subproblem for complexity reduction or parallelization. This report is a summary of discussions that happened at Dagstuhl seminar 23331 on "Recent Trends in Graph Decomposition" and presents currently open problems and future directions in the area of (hyper)graph decomposition.
Fichier principal
Vignette du fichier
openproblems.pdf (713.26 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-04251953 , version 1 (20-10-2023)
hal-04251953 , version 2 (14-12-2023)

Licence

Attribution

Identifiers

Cite

Deepak Ajwani, Rob H. Bisseling, Katrin Casel, Ümit V. Çatalyürek, Cédric Chevalier, et al.. Open Problems in (Hyper)Graph Decomposition. 2023. ⟨hal-04251953v2⟩
53 View
73 Download

Altmetric

Share

Gmail Facebook X LinkedIn More