Experiments with two heuristic algorithms for the maximum algebraic connectivity augmentation problem (Q510905): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Claudia Marcela Justel / rank
Normal rank
 
Property / author
 
Property / author: Claudia Marcela Justel / rank
 
Normal rank
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.endm.2016.10.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2554438291 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4507228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3114100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum algebraic connectivity augmentation is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: MATLAB kompakt / rank
 
Normal rank
Property / cites work
 
Property / cites work: nauty in Macaulay2 / rank
 
Normal rank

Latest revision as of 10:58, 13 July 2024

scientific article
Language Label Description Also known as
English
Experiments with two heuristic algorithms for the maximum algebraic connectivity augmentation problem
scientific article

    Statements

    Experiments with two heuristic algorithms for the maximum algebraic connectivity augmentation problem (English)
    0 references
    0 references
    0 references
    0 references
    14 February 2017
    0 references
    Laplacian matrix
    0 references
    algebraic connectivity
    0 references
    approximated algorithm
    0 references

    Identifiers