Accession Number:

ADA038867

Title:

Complexity Results for Bandwidth Minimization.

Descriptive Note:

Technical rept.,

Corporate Author:

STANFORD UNIV CALIF DEPT OF COMPUTER SCIENCE

Report Date:

1977-01-01

Pagination or Media Count:

38.0

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.

Subject Categories:

  • Theoretical Mathematics
  • Cybernetics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE