Bisection Algorithm of Increasing Algebraic Connectivity by Adding an Edge
From MaRDI portal
Publication:4978670
DOI10.1109/TAC.2009.2033763zbMath1368.05146OpenAlexW2170657228MaRDI QIDQ4978670
Publication date: 25 August 2017
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tac.2009.2033763
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)
Related Items (12)
Efficient identification of link importance in dynamic networks ⋮ Collision-free second-order vehicle formation control under time-varying network topology ⋮ Effects of adding arcs on the consensus convergence rate of leader-follower multi-agent systems ⋮ Fastest containment control of discrete-time multi-agent systems using static linear feedback protocol ⋮ Hypergraph analysis based on a compatible tensor product structure ⋮ Static output feedback stabilization of interconnected systems ⋮ Consensus rate regulation for general linear multi-agent systems under directed topology ⋮ Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra ⋮ Stability margin of undirected homogeneous relative sensing networks: a geometric perspective ⋮ Merging relative sensing networks: a stability margin perspective ⋮ Sensitivity-based link addition for robust linear dynamical networks ⋮ Partitioning of relative sensing networks: a stability margin perspective
This page was built for publication: Bisection Algorithm of Increasing Algebraic Connectivity by Adding an Edge
