Efficient identification of link importance in dynamic networks
DOI10.1016/J.JFRANKLIN.2014.11.011zbMATH Open1395.93179OpenAlexW2053253499MaRDI QIDQ1660587FDOQ1660587
Authors: Yoonsoo Kim
Publication date: 16 August 2018
Published in: Journal of the Franklin Institute (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jfranklin.2014.11.011
Recommendations
Applications of graph theory (05C90) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Sensitivity (robustness) (93B35) Control/observation systems governed by partial differential equations (93C20)
Cites Work
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- On Maximizing the Second Smallest Eigenvalue of a State-Dependent Graph Laplacian
- Design of Optimal Sparse Interconnection Graphs for Synchronization of Oscillator Networks
- Augmented Lagrangian Approach to Design of Structured Optimal State Feedback Gains
- Decentralized control of vehicle formations
- Structural controllability of multi-agent networks: robustness against simultaneous failures
- Combinatorial optimization. Theory and algorithms.
- Bisection Algorithm of Increasing Algebraic Connectivity by Adding an Edge
- Graph-Theoretic Analysis and Synthesis of Relative Sensing Networks
- Graph Weight Allocation to Meet Laplacian Spectral Constraints
Cited In (3)
Uses Software
This page was built for publication: Efficient identification of link importance in dynamic networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1660587)