A graph partitioning algorithm by node separators

DOI10.1145/66888.66890MaRDI QIDQ4371622zbMATH OpenOpenAlexFDO

Authors 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

bipartite graph matchingGaussian eliminationminimum degree orderingnested dissection algorithmpartitioningseparatorsparse and very large systemssparse matrixundirected graph

Mathematics Subject Classification ID

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

Cited in

(5)

• Using domain decomposition to find graph bisectors
• A hybrid breakout local search and reinforcement learning approach to the vertex separator problem
• On the validity of a front-oriented approach to partitioning large sparse graphs with a connectivity constraint
• A survey of direct methods for sparse linear systems
• Combinatorial generation via permutation languages. IV: Elimination trees

This page was built for publication: A graph partitioning algorithm by node separators

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