Algorithms for Finding Diameter-constrained Graphs with Maximum Algebraic Connectivity Chapter

abstract

• This article addresses a problem of synthesizing robust networks in the presence of constraints which limit the maximum number of links that connect any two nodes in the network. This problem arises in surveillance and monitoring applications where wireless sensor networks have to be deployed to collect and exchange time sensitive information among the vehicles. This network synthesis problem is formulated as a mixed-integer, semi-definite program, and an algorithm for finding the optimal solution is developed based on cutting plane and bisection methods. Computational results are presented to corroborate the performance of the proposed algorithm. Springer Science+Business Media New York 2012.

authors

• Darbha, Swaroop
• Rajagopal, Kumbakonam
• Rathinam, Sivakumar

author list (cited authors)

• Nagarajan, H., Rathinam, S., Darbha, S., & Rajagopal, K.

citation count

• 2

complete list of authors

• Nagarajan, Harsha||Rathinam, Sivakumar||Darbha, Swaroop||Rajagopal, Kumbakonam

Book Title

• Dynamics of Information Systems: Mathematical Foundations

publication date

• 2012

publisher

• Springer Nature  Publisher

published in

• Springer Proceedings in Mathematics and Statistics  Journal

keywords

• 46 Information And Computing Sciences
• 4605 Data Management And Data Science
• 49 Mathematical Sciences
• 4901 Applied Mathematics

Digital Object Identifier (DOI)

• 10.1007/978-1-4614-3906-6_6

International Standard Book Number (ISBN) 13

• 9781461439059

start page

• 121

end page

• 135

volume

• 20

URL

• http://dx.doi.org/10.1007/978-1-4614-3906-6_6