Bisection Algorithm of Increasing Algebraic Connectivity by Adding an Edge
From MaRDI portal
Cited in
(18)- Efficient identification of link importance in dynamic networks
- Collision-free second-order vehicle formation control under time-varying network topology
- Consensus rate regulation for general linear multi-agent systems under directed topology
- Merging relative sensing networks: a stability margin perspective
- Sensitivity-based link addition for robust linear dynamical networks
- Stability margin of undirected homogeneous relative sensing networks: a geometric perspective
- Partitioning of relative sensing networks: a stability margin perspective
- Static output feedback stabilization of interconnected systems
- Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra
- 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
- Optimal and poor synchronizations of directionally coupled phase-coherent chaotic oscillators
- Effects on the algebraic connectivity of weighted graphs under edge rotations
- Attainable bounds for algebraic connectivity and maximally connected regular graphs
- The consensus performance of leader-follower multi-agent systems under reversing the directions of arcs
- The role of arc rotation on improving consensus convergence rate for a leader-follower multi-agent system
- Improving consensus convergence rate and increasing sample period for sampled-data consensus of multi-agent systems based on rewiring
This page was built for publication: Bisection Algorithm of Increasing Algebraic Connectivity by Adding an Edge
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4978670)
