Bipartite Graph Summary

Source: Internet
Author: User

Now, the plan for the bipartite graph is probably finished.

The general question types are roughly divided into the following categories:

1. Determine the bipartite graph (this type of question is very interesting, often because there is a feeling of body filling)

2. The maximum matching (minimum) of a bipartite graph is the most frequently used topic with other algorithms (floyed, passing closure, binary ......)

3. Maximum right matching: this type of question is a weighted bipartite graph.

4. Multi-configuration matching. Faster than network streams

5. The maximum vertex is independent. There are many such types

6. The minimum path covers N-the maximum matching HLG and the questions from Zhou.

Now I think of these types of questions, and I will come back to supplement them later,

 

In addition, I have completed all the previous questions in the competition.

The system learning bipartite graph is about to come to an end.

 

Connection to competition questions:

Http://vjudge.net/vjudge/contest/view.action? Cid = 53855 # OVERVIEW

Bipartite Graph Summary

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.