Generalized gains for hybrid vertex separator algorithms

DOI10.1137/1.9781611976229.10MaRDI QIDQ6540002zbMATH OpenFDO

Authors Scott Kolodziej, Timothy A. Davis

Publication date 15 May 2024

Full work available at URL https://doi.org/10.1137/1.9781611976229.10

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Partitioning Sparse Matrices with Eigenvectors of Graphs
• General variable neighborhood search for computing graph separators
• An I/O-Efficient Algorithm for Computing Vertex Separators on Multi-Dimensional Grid Graphs and Its Applications
• Partitioning hypergraphs in scientific computing applications through vertex separators on graphs
• Partitioning planar graphs with costs and weights

This page was built for publication: Generalized gains for hybrid vertex separator algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6540002)