The bandwidth problem for graphs and matrices—a survey

P. Z Chinn, J. C., Dewdney, A. K., & Gibbs, N. E. (1982). The bandwidth problem for graphs and matrices—a survey.

Type

Unclassified

Intellectual base

Review or monograph

Year

1982

DOI

10.1002/jgt.3190060302

Link

https://doi.org/10.1002/jgt.3190060302

Cited by

1 citation across 1 artifact.

Domain-specific

• Graph bandwidth
  • Bandwidth is minimized over all bijective linear layouts rather than computed from one labeling, weighted and directed variants change the objective and it differs from matrix spectral bandwidth unless vertex permutation is included.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:ccb32e5a42fa · see in the full table