On complexity of special maximum matchings constructing

Simple item page
dc.creatorKamalian, R. R.
dc.creatorMkrtchyan, V. V.
dc.date2007-07-14
dc.date.accessioned2026-07-07T09:25:22Z
dc.date.available2026-07-07T09:25:22Z
dc.descriptionFor bipartite graphs the NP-completeness is proved for the problem of existence of maximum matching which removal leads to a graph with given lower(upper)bound for the cardinality of its maximum matching.
dc.description12 pages, 8 figures. Discrete Mathematics, to appear
dc.identifierhttps://arxiv.org/abs/0707.2126
dc.identifierhttp://arxiv.org/abs/0707.2126
dc.identifierDiscrete Mathematics, 2008, Vol 308/10 pp 1792-1800
dc.identifierdoi:10.1016/j.disc.2007.04.029
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/156380
dc.subjectDiscrete Mathematics
dc.titleOn complexity of special maximum matchings constructing
dc.typetext

Files

Collections

arXiv