Open Problems in (Hyper)Graph Decomposition - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2023

Open Problems in (Hyper)Graph Decomposition

Jakub Lacki
  • Fonction : Auteur
Darren Strash
  • Fonction : Auteur

Résumé

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
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

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

Licence

Paternité

Identifiants

Citer

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⟩
48 Consultations
67 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More