"Speeding up finite-time consensus via minimal polynomial of a weighted ..."

Zheming Wang, Chong Jin Ong (2018)

> Home

Details and statistics

DOI: 10.1016/J.AUTOMATICA.2018.03.067

access: closed

type: Journal Article

metadata version: 2025-01-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/automatica/WangO18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/automatica/WangO18
Zheming Wang, Chong Jin Ong:
Speeding up finite-time consensus via minimal polynomial of a weighted graph - A numerical approach. Autom. 93: 415-421 (2018)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.