Complexity Results for Bandwidth Minimization.

Abstract

A linear-time algorithm for sparse symmetric matrices which converts a matrix into pentadiagonal form (bandwidth 2), whenever it is possible to do so using simultaneous row and column permutations is described.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1977
Accession Number
ADA038867

Entities

People

  • D. E. Knuth
  • David S. Johnson
  • Michael R. Garey
  • Ronald L. Graham

Organizations

  • Stanford University

Tags

Communities of Interest

  • C4I
  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Animal Structures
  • Bandwidth
  • Computer Science
  • Computers
  • Construction
  • Filaments
  • Heuristic Methods
  • Military Research
  • New Jersey
  • Permutations
  • Polynomials
  • Sequences
  • Sparse Matrix
  • Two Dimensional
  • United States
  • United States Government