The bandwidth problem for graphs and matrices—a survey (Q3956994): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q50569546, #quickstatements; #temporary_batch_1711055989931
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5686285 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bandwidth problem and operations on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence matrices and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON PRIMITIVE GRAPHS AND OPTIMAL VERTEX ASSIGNMENTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5571274 / rank
 
Normal rank

Latest revision as of 15:48, 13 June 2024

scientific article
Language Label Description Also known as
English
The bandwidth problem for graphs and matrices—a survey
scientific article

    Statements

    The bandwidth problem for graphs and matrices—a survey (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1982
    0 references
    bandwidth
    0 references
    vertex-labelling
    0 references
    graph invariants
    0 references
    approximate bandwidth algorithms
    0 references

    Identifiers

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