Zobrazeno 1 - 10
of 47
pro vyhledávání: '"HEUER, TOBIAS"'
Autor:
Ajwani, Deepak, Bisseling, Rob H., Casel, Katrin, Çatalyürek, Ümit V., Chevalier, Cédric, Chudigiewitsch, Florian, Faraj, Marcelo Fonseca, Fellows, Michael, Gottesbüren, Lars, Heuer, Tobias, Karypis, George, Kaya, Kamer, Lacki, Jakub, Langguth, Johannes, Li, Xiaoye Sherry, Mayer, Ruben, Meintrup, Johannes, Mizutani, Yosuke, Pellegrini, François, Petrini, Fabrizio, Rosamond, Frances, Safro, Ilya, Schlag, Sebastian, Schulz, Christian, Sharma, Roohani, Strash, Darren, Sullivan, Blair D., Uçar, Bora, Yzelman, Albert-Jan
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 c
Externí odkaz:
http://arxiv.org/abs/2310.11812
Autor:
Heuer, Tobias
Minimizing wire-lengths is one of the most important objectives in circuit design. The process involves initially placing the logical units (cells) of a circuit onto a physical layout, and subsequently routing the wires to connect the cells. Hypergra
Externí odkaz:
http://arxiv.org/abs/2309.16694
Balanced hypergraph partitioning is an NP-hard problem with many applications, e.g., optimizing communication in distributed data placement problems. The goal is to place all nodes across $k$ different blocks of bounded size, such that hyperedges spa
Externí odkaz:
http://arxiv.org/abs/2303.17679
Autor:
Holzenkamp, Tim, Kuryshev, Kevin, Oltmann, Thomas, Wäldele, Lucas, Zuber, Johann, Heuer, Tobias, Iser, Markus
Visual layouts of graphs representing SAT instances can highlight the community structure of SAT instances. The community structure of SAT instances has been associated with both instance hardness and known clause quality heuristics. Our tool SATViz
Externí odkaz:
http://arxiv.org/abs/2209.05838
Autor:
Çatalyürek, Ümit V., Devine, Karen D., Faraj, Marcelo Fonseca, Gottesbüren, Lars, Heuer, Tobias, Meyerhenke, Henning, Sanders, Peter, Schlag, Sebastian, Schulz, Christian, Seemaier, Daniel, Wagner, Dorothea
In recent years, significant advances have been made in the design and evaluation of balanced (hyper)graph partitioning algorithms. We survey trends of the last decade in practical algorithms for balanced (hyper)graph partitioning together with futur
Externí odkaz:
http://arxiv.org/abs/2205.13202
We present a shared-memory parallelization of flow-based refinement, which is considered the most powerful iterative improvement technique for hypergraph partitioning at the moment. Flow-based refinement works on bipartitions, so current sequential p
Externí odkaz:
http://arxiv.org/abs/2201.01556