Maintaining an EDCS in General Graphs: Simpler, Density-Sensitive and with Worst-Case Time Bounds.
Fabrizio GrandoniChris SchwiegelshohnShay SolomonAmitai UzradPublished in: CoRR (2021)
Keyphrases
- worst case
- lower bound
- average case
- upper bound
- error bounds
- special case
- closely related
- computational complexity
- np hard
- worst case analysis
- np complete
- machine learning
- greedy algorithm
- graph matching
- worst case bounds
- running times
- directed graph
- upper and lower bounds
- graph theory
- approximation algorithms
- optimal solution
- genetic algorithm