A graph partitioning algorithm by node separators (Q4371622)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1105992
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A graph partitioning algorithm by node separators |
scientific article; zbMATH DE number 1105992 |
Statements
A graph partitioning algorithm by node separators (English)
0 references
4 February 1998
0 references
sparse and very large systems
0 references
bipartite graph matching
0 references
minimum degree ordering
0 references
partitioning
0 references
separator
0 references
sparse matrix
0 references
undirected graph
0 references
nested dissection algorithm
0 references
Gaussian elimination
0 references
