Speeding up finite-time consensus via minimal polynomial of a weighted graph -- a numerical approach (Q1797040): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q129999084, #quickstatements; #temporary_batch_1726270017965 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q129999084 / rank | |||
Normal rank | |||
Latest revision as of 00:32, 14 September 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Speeding up finite-time consensus via minimal polynomial of a weighted graph -- a numerical approach |
scientific article |
Statements
Speeding up finite-time consensus via minimal polynomial of a weighted graph -- a numerical approach (English)
0 references
17 October 2018
0 references
Laplacian matrix
0 references
rank minimization
0 references
minimal polynomial
0 references
consensus algorithm
0 references
0 references
