Maximum Matching on Trees in the Online Preemptive and the Incremental Graph Models
Sign Up to like & getrecommendations! Published in 2019 at "Algorithmica"
DOI: 10.1007/s00453-019-00593-6
Abstract: We study the Maximum Cardinality Matching (MCM) and the Maximum Weight Matching (MWM) problems, on trees and on some special classes of graphs, in the online preemptive and the incremental graph models. In the Online… read more here.
Keywords: algorithm; model; graph; online preemptive ... See more keywords