Input-dynamic distributed graph algorithms for congested networks.
Klaus-Tycho FoersterJanne H. KorhonenAmi PazJoel RybickiStefan SchmidPublished in: CoRR (2020)
Keyphrases
- graph theory
- dynamic networks
- minimum spanning tree
- computational complexity
- distributed environment
- betweenness centrality
- distributed systems
- learning algorithm
- computer networks
- graph properties
- random graphs
- graph model
- directed acyclic graph
- directed graph
- constraint satisfaction problems
- input data
- social networks