Reordering the Reorderable Matrix as an Algorithmic Problem
Authors:
- 1 January 2000
- book chapter
- Published by Springer Nature
- p. 453-468
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- On Crossing Numbers, and some Unsolved Problems1997
- 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic AlgorithmsJournal of Graph Algorithms and Applications, 1997
- Algorithms for drawing graphs: an annotated bibliographyComputational Geometry, 1994
- The bandwidth problem for graphs and matrices—a surveyJournal of Graph Theory, 1982
- Graphics and Graphic Information Processing1981
- Methods for Visual Understanding of Hierarchical System StructuresIEEE Transactions on Systems, Man, and Cybernetics, 1981
- Complexity Results for Bandwidth MinimizationSIAM Journal on Applied Mathematics, 1978
- Algorithmic Aspects of Vertex Elimination on Directed GraphsSIAM Journal on Applied Mathematics, 1978