Algorithms for Finding Diameter-constrained Graphs with Maximum Algebraic Connectivity (Q5326888)
From MaRDI portal
scientific article; zbMATH DE number 6193590
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for Finding Diameter-constrained Graphs with Maximum Algebraic Connectivity |
scientific article; zbMATH DE number 6193590 |
Statements
Algorithms for Finding Diameter-constrained Graphs with Maximum Algebraic Connectivity (English)
0 references
1 August 2013
0 references
algebraic connectivity
0 references
robust network
0 references
mixed-integer semi-definite program
0 references
unmanned vehicles
0 references
0 references
