Experiments with two heuristic algorithms for the maximum algebraic connectivity augmentation problem

DOI10.1016/j.endm.2016.10.004zbMath1356.05075OpenAlexW2554438291MaRDI QIDQ510905

Carlos Rocha, Emanuelle Chaves, Claudia Marcela Justel

Publication date: 14 February 2017

Full work available at URL: https://doi.org/10.1016/j.endm.2016.10.004

zbMATH Keywords

Laplacian matrixalgebraic connectivityapproximated algorithm

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40)

Related Items

Augmenting the algebraic connectivity for certain families of graphs

Cites Work

• nauty in Macaulay2
• Maximum algebraic connectivity augmentation is NP-hard
• MATLAB kompakt
• Unnamed Item
• Unnamed Item