Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Lars Gottesbüren"'
Publikováno v:
Algorithms, Vol 12, Iss 9, p 196 (2019)
Graph partitioning has many applications. We consider the acceleration of shortest path queries in road networks using Customizable Contraction Hierarchies (CCH). It is based on computing a nested dissection order by recursively dividing the road net
Externí odkaz:
https://doaj.org/article/429da88a6b7a40d88bf54074916ca690
Autor:
Sebastian Schlag, Tobias Heuer, Lars Gottesbüren, Yaroslav Akhremtsev, Christian Schulz, Peter Sanders
Publikováno v:
ACM Journal of Experimental Algorithmics. 27:1-39
Hypergraphs are a generalization of graphs where edges (aka nets ) are allowed to connect more than two vertices. They have a similarly wide range of applications as graphs. This article considers the fundamental and intensively studied problem of ba
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8022b9a15b37cc3267a7963d48c94a05
https://doi.org/10.1145/3529090
https://doi.org/10.1145/3529090
Autor:
Ümit Çatalyürek, Karen Devine, Marcelo Faraj, Lars Gottesbüren, Tobias Heuer, Henning Meyerhenke, Peter Sanders, Sebastian Schlag, Christian Schulz, Daniel Seemaier, Dorothea Wagner
In recent years, significant advances have been made in the design and evaluation of balanced (hyper)graph partitioning algorithms. We survey trends of the past decade in practical algorithms for balanced (hyper)graph partitioning together with futur
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3802c198411db079bb3db56ed5773a53
Autor:
Lars Gottesbüren, Michael Hamann
Publikováno v:
Euro-Par 2022: Parallel Processing ISBN: 9783031125966
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7cf8f4893e17e5564baa2a3d5e3bf119
https://doi.org/10.1007/978-3-031-12597-3_19
https://doi.org/10.1007/978-3-031-12597-3_19