Graph Weight Allocation to Meet Laplacian Spectral Constraints
From MaRDI portal
Publication:5352896
DOI10.1109/TAC.2011.2181795zbMath1369.93230MaRDI QIDQ5352896
No author found.
Publication date: 8 September 2017
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Eigenvalue problems (93B60) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inequalities involving eigenvalues and eigenvectors (15A42)
Related Items (3)
Efficient identification of link importance in dynamic networks ⋮ Cooperative tracking control of single-integrator multi-agent systems with multiple leaders ⋮ Indiscernible topological variations in DAE networks
This page was built for publication: Graph Weight Allocation to Meet Laplacian Spectral Constraints
