Bandwidth and pebbling
- 1 June 1983
- journal article
- Published by Springer Nature in Computing
- Vol. 31 (2) , 115-139
- https://doi.org/10.1007/bf02259908
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- A comparison of two variations of a pebble game on graphsTheoretical Computer Science, 1981
- Pebbling and bandwidthPublished by Springer Nature ,1981
- The Pebbling Problem is Complete in Polynomial SpaceSIAM Journal on Computing, 1980
- Complexity Results for Bandwidth MinimizationSIAM Journal on Applied Mathematics, 1978
- A pspace complete problem related to a pebble gamePublished by Springer Nature ,1978
- On Time Versus SpaceJournal of the ACM, 1977
- Space and Time Hierarchies for Classes of Control Structures and Data StructuresJournal of the ACM, 1976
- An observation on time-storage trade offJournal of Computer and System Sciences, 1974
- Note on minimizing the bandwidth of sparse, symmetric matricesComputing, 1973
- A GRAPH-THEORETIC STUDY OF THE NUMERICAL SOLUTION OF SPARSE POSITIVE DEFINITE SYSTEMS OF LINEAR EQUATIONSPublished by Elsevier ,1972