Distributed Approximations of f-Matchings and b-Matchings in Graphs of Sub-Logarithmic Expansion.
Andrzej CzygrinowMichal HanckowiakMarcin WitkowskiPublished in: ISAAC (2021)
Keyphrases
- maximum cardinality
- bipartite graph
- efficient computation
- distributed systems
- distributed data
- distributed environment
- peer to peer
- graph matching
- fault tolerant
- multi agent
- graph theoretic
- distributed sensor networks
- minimum spanning tree
- graph construction
- graph representation
- minimum weight
- database
- graph mining
- closed form
- graphical models
- cooperative
- database systems
- data sets
- real time