A constructive bandwidth reduction algorithm -- a variant of GPS algorithm (Q504151): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.akcej.2016.06.014 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2476862062 / 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: A spectral algorithm for envelope reduction of sparse matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4848765 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nodal ordering for bandwidth reduction using ant system algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP and path relinking for the matrix bandwidth minimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for reducing the bandwidth and profile of a sparse matrix / rank
 
Normal rank

Latest revision as of 07:45, 13 July 2024

scientific article
Language Label Description Also known as
English
A constructive bandwidth reduction algorithm -- a variant of GPS algorithm
scientific article

    Statements

    A constructive bandwidth reduction algorithm -- a variant of GPS algorithm (English)
    0 references
    0 references
    0 references
    25 January 2017
    0 references
    bandwidth reduction
    0 references
    sparse symmetric matrix
    0 references
    GPS algorithm
    0 references
    reordering of graph vertices
    0 references
    BFS algorithm
    0 references

    Identifiers