Pages that link to "Item:Q2628456"
From MaRDI portal
The following pages link to Graph diameter, eigenvalues, and minimum-time consensus (Q2628456):
Displaying 10 items.
- Lower bounds on complexity of Lyapunov functions for switched linear systems (Q286067) (← links)
- A fast clock synchronization algorithm for wireless sensor networks (Q1642215) (← links)
- Speeding up finite-time consensus via minimal polynomial of a weighted graph -- a numerical approach (Q1797040) (← links)
- Characterizing limits and opportunities in speeding up Markov chain mixing (Q2029783) (← links)
- Multi-agent control: a graph-theoretic perspective (Q2070030) (← links)
- Distributed Model Predictive Control of linear discrete-time systems with local and global constraints (Q2409231) (← links)
- Step-size sequence design for finite-time average consensus in secure wireless sensor networks (Q2454145) (← links)
- Distributed fixed point method for solving systems of linear algebraic equations (Q2665725) (← links)
- Linear Time Average Consensus and Distributed Optimization on Fixed Graphs (Q4599719) (← links)
- Performance and robustness of discrete and finite time average consensus algorithms (Q5027790) (← links)
