A New Algorithm for Finding a Pseudoperipheral Node in a Graph (Q3474202)
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 4141390
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A New Algorithm for Finding a Pseudoperipheral Node in a Graph |
scientific article; zbMATH DE number 4141390 |
Statements
A New Algorithm for Finding a Pseudoperipheral Node in a Graph (English)
0 references
1990
0 references
pseudoperipheral node in a graph
0 references
sparse matrices
0 references
reordering algorithms
0 references
bandwidth reduction
0 references
reverse Cuthill-McKee algorithm
0 references
eigenvalues of graphs
0 references
positive eigenvector
0 references
adjacency matrix
0 references
Gibbs-Poole-Stockmeyer algorithm
0 references
0.94636774
0 references
0.91798747
0 references
0.8711197
0 references
0.8613821
0 references
0.85000616
0 references
