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

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Harwell-Boeing sparse matrix collection / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0167-6377(98)00040-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2016287305 / rank
 
Normal rank

Latest revision as of 10:47, 30 July 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