A graph partitioning algorithm by node separators

DOI10.1145/66888.66890zbMath0900.65060OpenAlexW2030118642MaRDI QIDQ4371622

Joseph W. H. Liu

Publication date: 4 February 1998

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: http://www.acm.org/pubs/contents/journals/toms/1989-15/

zbMATH Keywords

partitioningGaussian eliminationsparse matrixundirected graphseparatorminimum degree orderingnested dissection algorithmbipartite graph matchingsparse and very large systems

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items

Using domain decomposition to find graph bisectors ⋮ On the validity of a front-oriented approach to partitioning large sparse graphs with a connectivity constraint ⋮ A hybrid breakout local search and reinforcement learning approach to the vertex separator problem ⋮ A survey of direct methods for sparse linear systems