Two polynomial algorithms for special maximum matching constructing in trees

Simple item page
dc.creatorKamalian, R. R.
dc.creatorMkrtchyan, V. V.
dc.date2007-07-16
dc.date.accessioned2026-07-07T08:18:32Z
dc.date.available2026-07-07T08:18:32Z
dc.descriptionFor an arbitrary tree we investigate the problems of constructing a maximum matching which minimizes or maximizes the cardinality of a maximum matching of the graph obtained from original one by its removal and present corresponding polynomial algorithms.
dc.description55 pages, 38 figures, Submitted to Discrete Applied Mathematics
dc.identifierhttps://arxiv.org/abs/0707.2295
dc.identifierhttp://arxiv.org/abs/0707.2295
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134466
dc.subjectDiscrete Mathematics
dc.titleTwo polynomial algorithms for special maximum matching constructing in trees
dc.typetext

Files

Collections

arXiv