Two polynomial algorithms for special maximum matching constructing in trees

Details Two polynomial algorithms for special maximum matching constructing in trees Two polynomial algorithms for special maximum matching constructing in trees

2007-07-16

arxiv.org/abs/0707.2295v1

Computer Science

Discrete Mathematics

55 pages, 38 figures, Submitted to Discrete Applied Mathematics

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

Two polynomial algorithms for special maximum matching constructing in trees 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 Two polynomial algorithms for special maximum matching constructing in trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Two polynomial algorithms for special maximum matching constructing in trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-195092