Login / Signup
Improved Bounds for Fully Dynamic Matching via Ordered Ruzsa-Szemerédi Graphs.
Sepehr Assadi
Sanjeev Khanna
Published in:
CoRR (2024)
Keyphrases
</>
graph matching
matching algorithm
dynamic networks
subgraph isomorphism
lower bound
upper bound
image matching
data sets
worst case
dynamic environments
complex networks
lower and upper bounds
graph structures
dynamic graph
maximum cardinality