Directed Graph Consensus is a consensus algorithm that achieves agreement among nodes in a network by iteratively exchanging state information over a directed graph topology, where edges represent asymmetric communication links that permit information flow in only one direction.
191
Publications
14.1K
Citations
412
Authors
209
Institutions
Publications per year
2017–2026
87
Parents
Publications
191
1–5 of 191
Authors
412
- CN
11
h-index
- ZL
8
h-index
- ZD
7
h-index
- YL
7
h-index
- NH
6
h-index
1–5 of 412
Institutions
209
Peking University
Beijing, China
11 h-index
26 publications
3.7K citations
University of Illinois Urbana-Champaign
Urbana, United States
11 h-index
24 publications
2.1K citations
University of Cyprus
Nicosia, Cyprus
9 h-index
11 publications
609 citations
State Key Laboratory of Turbulence and Complex Systems
Beijing, China
9 h-index
20 publications
3.4K citations
Australian National University
Canberra, Australia
8 h-index
12 publications
2.6K citations
Harbin Institute of Technology
Harbin, China
8 h-index
9 publications
476 citations
University of California, Riverside
Riverside, United States
8 h-index
12 publications
2.4K citations
City University of Hong Kong
Hong Kong, Hong Kong
7 h-index
7 publications
627 citations
1–8 of 209
Venues
- IEEE Transactions on Automatic Control
26 publications · 4.2K citations
23
h-index
- Automatica
12 publications · 1.6K citations
11
h-index
- IET Control Theory and Applications
8 publications · 255 citations
8
h-index
- IEEE Transactions on Control of Network Systems
7 publications · 340 citations
7
h-index
- IEEE Transactions on Cybernetics
5 publications · 415 citations
5
h-index
1–5