Bandwidth and pebbling
type: Item
instance of: scholarly article
title: Bandwidth and pebbling
zbMATH Open document ID: 0509.90100
DOI: 10.1007/BF02259908
author: I. H. Sudborough
author: Arnold L. Rosenberg
published in: Computing
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 91A24
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3805314
zbMATH Keywords: bandwidth of a graph
zbMATH Keywords: computational pebble game
zbMATH Keywords: directed acyclic graphs
zbMATH Keywords: breadth-first pebble game
zbMATH Keywords: undirected graphs
zbMATH Keywords: games on graphs
zbMATH Keywords: NP- completeness
MaRDI profile type: Publication
cites work: Note on minimizing the bandwidth of sparse, symmetric matrices
cites work: An observation on time-storage trade off
cites work: Complexity Results for Bandwidth Minimization
cites work: The Pebbling Problem is Complete in Polynomial Space
cites work: On Time Versus Space
cites work: Q4194458
cites work: Space and Time Hierarchies for Classes of Control Structures and Data Structures
cites work: A comparison of two variations of a pebble game on graphs
cites work: Bandwidth contrained NP-complete problems
cites work: The NP-completeness of the bandwidth minimization problem
cites work: Q4185781
cites work: Q3947137
cites work: Q5683627
cites work: Data encodings and their costs
cites work: Bounds on the costs of data encodings
cites work: Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time
cites work: Complete Register Allocation Problems
full work available at URL: https://doi.org/10.1007/bf02259908
OpenAlex ID: W177441241
description: scientific article; zbMATH DE number 3805314