Maximum Matching on Trees in the Online Preemptive and the Incremental Graph Models.

Sumedh Tirodkar Sundar Vishwanathan

Published in: Algorithmica (2019)

Keyphrases

maximum matching
bipartite graph
online learning
stable set
decision trees
scheduling problem
real time
e learning
lower bound
single machine
training data
np complete
incremental learning
processing times
batch mode