Login / Signup
Maintaining an EDCS in General Graphs: Simpler, Density-Sensitive and with Worst-Case Time Bounds.
Fabrizio Grandoni
Chris Schwiegelshohn
Shay Solomon
Amitai Uzrad
Published in:
SOSA (2022)
Keyphrases
</>
worst case
upper bound
average case
lower bound
special case
error bounds
graph matching
graph theory
greedy algorithm
graph theoretic
worst case scenario
data sets
loss bounds
low density
graph kernels
np hard
neural network