(2Δ - l)-Edge-Coloring is Much Easier than Maximal Matching in the Distributed Setting.
Michael ElkinSeth PettieHsin-Hao SuPublished in: SODA (2015)
Keyphrases
- matching algorithm
- cooperative
- distributed systems
- graph matching
- edge information
- multi agent
- pattern matching
- distributed environment
- matching process
- keypoints
- minimum distance
- distributed computing
- fault tolerant
- lightweight
- peer to peer
- edge detection
- computer networks
- weighted graph
- image features
- learning algorithm
- distributed data
- genetic algorithm