Experiments with two heuristic algorithms for the maximum algebraic connectivity augmentation problem (Q510905): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
(One intermediate revision by one other user 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.endm.2016.10.004 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2554438291 / rank | |||
Normal rank |
Revision as of 01:14, 20 March 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
14 February 2017
0 references
Laplacian matrix
0 references
algebraic connectivity
0 references
approximated algorithm
0 references