On complexity of special maximum matchings constructing

Details On complexity of special maximum matchings constructing On complexity of special maximum matchings constructing

2007-07-14

arxiv.org/abs/0707.2126v1

Discrete Mathematics, 2008, Vol 308/10 pp 1792-1800

Computer Science

Discrete Mathematics

12 pages, 8 figures. Discrete Mathematics, to appear

Scientific paper

10.1016/j.disc.2007.04.029

For 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.

Affiliated with

Also associated with

No associations

Rating

On complexity of special maximum matchings constructing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On complexity of special maximum matchings constructing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On complexity of special maximum matchings constructing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-253919