A new matrix bandwidth reduction algorithm (Q1306383): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bandwidth problem for graphs and matrices—a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3740904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4261041 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Profile Minimization Problem in Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution methods and computational investigations for the linear bottleneck assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3714651 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for maximum matchings in convex, bipartite graphs / rank
 
Normal rank

Revision as of 08:29, 29 May 2024

scientific article
Language Label Description Also known as
English
A new matrix bandwidth reduction algorithm
scientific article

    Statements

    A new matrix bandwidth reduction algorithm (English)
    0 references
    0 references
    0 references
    0 references
    19 December 1999
    0 references
    matrix bandwith reduction
    0 references
    bottleneck assignment
    0 references
    graph partitioning
    0 references
    node renumbering
    0 references

    Identifiers