Using domain decomposition to find graph bisectors
type: Item
instance of: scholarly article
title: Using domain decomposition to find graph bisectors
zbMATH Open document ID: 1043.65509
DOI: 10.1007/BF02510238
author: Cleve Ashcraft
author: Joseph W. H. Liu
published in: BIT
publication date: 1998-02-02T00:00:00Z
Mathematics Subject Classification ID: 65F50
Mathematics Subject Classification ID: 65F05
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1087016
describes a project that uses: Chaco
describes a project that uses: METIS
describes a project that uses: symrcm
MaRDI profile type: Publication
cites work: Compressed Graphs and the Minimum Degree Algorithm
cites work: Applications of the Dulmage--Mendelsohn Decomposition and Network Flow to Graph Bisection Improvement
cites work: Q4327462
cites work: Robust Ordering of Sparse Matrices using Multisection
cites work: Finding good approximate vertex and edge partitions is NP-hard
cites work: Nested Dissection of a Regular Finite Element Mesh
cites work: Q3664299
cites work: The Evolution of the Minimum Degree Ordering Algorithm
cites work: An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
cites work: A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
cites work: An Efficient Heuristic Procedure for Partitioning Graphs
cites work: A graph partitioning algorithm by node separators
cites work: Computing the block triangular form of a sparse matrix
cites work: Partitioning Sparse Matrices with Eigenvectors of Graphs
cites work: Q3694703
cites work: Q3326832
cites work: Q4327525
full work available at URL: https://doi.org/10.1007/bf02510238
OpenAlex ID: W2086609738
description: scientific article; zbMATH DE number 1087016