The NP-completeness of the bandwidth minimization problem (Q1223124): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Sparse matrices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimizing the bandwidth of sparse symmetric matrices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Note on minimizing the bandwidth of sparse, symmetric matrices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4142699 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4091421 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some simplified NP-complete graph problems / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02280884 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W85690038 / rank | |||
Normal rank | |||
Latest revision as of 08:33, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The NP-completeness of the bandwidth minimization problem |
scientific article |
Statements
The NP-completeness of the bandwidth minimization problem (English)
0 references
1976
0 references
