Efficient identification of link importance in dynamic networks
type: Item
instance of: scholarly article
title: Efficient identification of link importance in dynamic networks
zbMATH Open document ID: 1395.93179
author: Yoonsoo Kim
published in: Journal of the Franklin Institute
publication date: 2018-08-16T00:00:00Z
Mathematics Subject Classification ID: 93B35
Mathematics Subject Classification ID: 93C20
Mathematics Subject Classification ID: 05C90
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 6918990
zbMATH Keywords: efficient identification
zbMATH Keywords: link importance
zbMATH Keywords: dynamic networks
describes a project that uses: SeDuMi
describes a project that uses: SeDuMi Interface
describes a project that uses: YALMIP
MaRDI profile type: Publication
full work available at URL: j.jfranklin.2014.11.011
OpenAlex ID: W2053253499
cites work: Bisection Algorithm of Increasing Algebraic Connectivity by Adding an Edge
cites work: Graph-Theoretic Analysis and Synthesis of Relative Sensing Networks
cites work: Design of Optimal Sparse Interconnection Graphs for Synchronization of Oscillator Networks
cites work: Graph Weight Allocation to Meet Laplacian Spectral Constraints
cites work: Augmented Lagrangian Approach to Design of Structured Optimal State Feedback Gains
cites work: Combinatorial optimization. Theory and algorithms.
cites work: Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
cites work: Structural controllability of multi-agent networks: robustness against simultaneous failures
cites work: On Maximizing the Second Smallest Eigenvalue of a State-Dependent Graph Laplacian
cites work: Decentralized control of vehicle formations
cites work: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
DOI: 10.1016/J.JFRANKLIN.2014.11.011
description: scientific article; zbMATH DE number 6918990