Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs.

George B. Mertzios André Nichterlein Rolf Niedermeier

Published in: CoRR (2017)

Keyphrases

maximum cardinality
bipartite graph
minimum weight
matching algorithm
worst case
dynamic programming
learning algorithm
search space
objective function
computational complexity
particle swarm optimization
endpoints
minimum spanning tree
np hard
scheduling problem
segmentation algorithm