Adaptive estimation using multiagent network identifiers with undirected and directed graph topologies.
Teymur SadikhovMichael A. DemetriouWassim M. HaddadTansel YucelenPublished in: ACC (2013)
Keyphrases
- directed graph
- directed edges
- strongly connected
- multi agent
- random walk
- network topologies
- source node
- undirected graph
- directed acyclic graph
- computer networks
- fully connected
- maximum flow
- edge weights
- cooperative
- communication networks
- complex networks
- shortest path problem
- network structure
- special case
- graph properties
- graph structure
- network topology
- web graph
- multi agent systems
- disjoint paths