Question

Question 1 (10 points) From Fred Buckley, Marty Lewinter A Friendly Introduction to Graph Theory Ann, Dan, Fan, Nan, and Van are applying for jobs a,b,c,d, and e. Ann is qualified for a, b, and c; Dan for b, d, and e; Fan for b and c; Nan for c and d; and Van for b. Find a maximum matching to create maximum employment.
0 0
Add a comment Improve this question Transcribed image text
Answer #1

If we draw a graph for this problem,

For Job A only Ann is qualified

For Job B Ann, Dan, Fan, Van are qualified

For Job C Ann, Fan, Nan are qualified

For Job D Dan, Nan are qualified

For Job E only Dan is qualified

so maximum matching to create maximum employment will be Job B, as it has maximum people who are qualified.

Add a comment
Know the answer?
Add Answer to:
Question 1 (10 points) From Fred Buckley, Marty Lewinter "A Friendly Introduction to Graph Theory" Ann,...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT