Algorithms for Finding Diameter-constrained Graphs with Maximum Algebraic Connectivity

DOI10.1007/978-1-4614-3906-6_6zbMath1268.90117OpenAlexW2216475801MaRDI QIDQ5326888

Sivakumar Rathinam, Harsha Nagarajan, Kumbakonam R. Rajagopal, Swaroop Darbha

Publication date: 1 August 2013

Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4614-3906-6_6

zbMATH Keywords

algebraic connectivityunmanned vehiclesmixed-integer semi-definite programrobust network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Semidefinite programming (90C22) Mixed integer programming (90C11) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Heuristics for synthesizing robust networks with a diameter constraint

Uses Software

• SeDuMi
• CPLEX
• YALMIP

Cites Work

• Maximum algebraic connectivity augmentation is NP-hard
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
• Information Flow and Cooperative Control of Vehicle Formations
• Unnamed Item

This page was built for publication: Algorithms for Finding Diameter-constrained Graphs with Maximum Algebraic Connectivity