two hours map is an undirected graph, it n vertices can be divided into two pools A and B pools. but the same set of arbitrary vertex of the two map linked to the billboard (that is, any one side is a culmination of the pool A, in another pool B). If and only if each of the B vertex with at least one vertex A connected, A subset of a pool A B coverage (or simple to say that A is a cover). A coverage of the size shall A number of vertices. If and only if A is a subset B coverage focus on the smallest, A for minimum coverage.

Packet : 115157677二分覆盖.rar filelist
二分覆盖.txt

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．