Algorithms for finding diameter-constrained graphs with maximum algebraic connectivity

DOI10.1007/978-1-4614-3906-6_6MaRDI QIDQ5326888zbMATH OpenOpenAlexFDO

Authors Harsha Nagarajan, Sivakumar Rathinam, S. Darbha, K. R. Rajagopal

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 connectivitymixed-integer semi-definite programrobust networkunmanned vehicles

Mathematics Subject Classification ID

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

Recommendations

• Heuristics for synthesizing robust networks with a diameter constraint
• Constrained distributed algebraic connectivity maximization in robotic networks
• Solving diameter-constrained minimum spanning tree problems by constraint programming
• A new algorithm for generating biconnected spanning subgraphs for topological optimization of data networks
• Graphs with given diameter maximizing the algebraic connectivity

Cites work

• scientific article; zbMATH DE number 795222 (Why is no real title available?)
• Information Flow and Cooperative Control of Vehicle Formations
• Maximum algebraic connectivity augmentation is NP-hard
• Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones

Cited in

(6)

• Heuristics for synthesizing robust networks with a diameter constraint
• A faster diameter problem algorithm for a chordal graph, with a connection to its center problem
• Extremizing algebraic connectivity subject to graph theoretic constraints
• Maximizing Algebraic Connectivity Over Unicyclic Graphs
• Algebraic and computer-based methods in the undirected degree/diameter problem - A brief survey
• Algorithms for (0, 1,d)-graphs withdconstrains

Describes a project that uses

Uses Software

• YALMIP
• SeDuMi
• CPLEX

This page was built for publication: Algorithms for finding diameter-constrained graphs with maximum algebraic connectivity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5326888)