The NP-completeness of the bandwidth minimization problem (Q1223124): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
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

Revision as of 18:09, 12 June 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
    0 references
    1976
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references