@online{Ajwani2310.11812,
TITLE = {Open Problems in (Hyper)Graph Decomposition},
AUTHOR = {Ajwani, Deepak and Bisseling, Rob H. and Casel, Katrin and {\c C}ataly{\"u}rek, {\"U}mit V. and Chevalier, C{\'e}dric and Chudigiewitsch, Florian and Faraj, Marcelo Fonseca and Fellows, Michael and Gottesb{\"u}ren, Lars and Heuer, Tobias and Karypis, George and Kaya, Kamer and Lacki, Jakub and Langguth, Johannes and Li, Xiaoye Sherry and Mayer, Ruben and Meintrup, Johannes and Mizutani, Yosuke and Pellegrini, Fran{\c c}ois and Petrini, Fabrizio and Rosamond, Frances and Safro, Ilya and Schlag, Sebastian and Schulz, Christian and Sharma, Roohani and Strash, Darren and Sullivan, Blair D. and U{\c c}ar, Bora and Yzelman, Albert-Jan},
LANGUAGE = {eng},
URL = {https://arxiv.org/abs/2310.11812},
EPRINT = {2310.11812},
EPRINTTYPE = {arXiv},
YEAR = {2023},
MARGINALMARK = {$\bullet$},
ABSTRACT = {Large networks are useful in a wide range of applications. Sometimes problem<br>instances are composed of billions of entities. Decomposing and analyzing these<br>structures helps us gain new insights about our surroundings. Even if the final<br>application concerns a different problem (such as traversal, finding paths,<br>trees, and flows), decomposing large graphs is often an important subproblem<br>for complexity reduction or parallelization. This report is a summary of<br>discussions that happened at Dagstuhl seminar 23331 on "Recent Trends in Graph<br>Decomposition" and presents currently open problems and future directions in<br>the area of (hyper)graph decomposition.<br>},
}