A lower bound on the acyclic matching number of subcubic graphs.

Maximilian Fürst Dieter Rautenbach

Published in: Discret. Math. (2018)

Keyphrases

lower bound
np hard
upper bound
branch and bound algorithm
graph matching
connected graphs
matching algorithm
special case
np complete
randomized algorithm