The issue of top coating

One of problems that the issue of top coating (ちょうてんひふくもんだい) is one of the problems in the calculation complexity theory and belongs to NP perfection.

Contents

The issue of top coating is graph G(V,E) (in V in top, E a side) and k < |V| When となる integer k was given, it is a problem to search for subset V' of following V.

Either at least one of the endpoint is | among subset V' of V included in V' about each branch e of problem graph G(V,E) V'| = Find whether a thing becoming k exists.

It is | again V'| The problem for the の minimum is called the issue of smallest top coating, and, as for this, it is in a problem to belong to NP difficulty.

The issue of top coating is related with the issue of independent meeting deeply. For the graph of the top of the n unit, the reason why top coating of size k existing and an independent top set of size n-k exist is that it is the equivalent.

Allied item

• Top coating
• NP perfect problem
• The issue of smallest top coating

This item is an unfinished item in conjunction with the mathematics (including the mathematician). I demand the cooperator who corrects it, and corrects this item (a project: mathematics /Portal: mathematics).

It is acquired by "issue of https://ja.wikipedia.org/w/index.php?title= top coating &oldid=58363645"

This article is taken from the Japanese Wikipedia The issue of top coating

This article is distributed by cc-by-sa or GFDL license in accordance with the provisions of Wikipedia.

Wikipedia and Tranpedia does not guarantee the accuracy of this document. See our disclaimer for more information.

In addition, Tranpedia is simply not responsible for any show is only by translating the writings of foreign licenses that are compatible with CC-BY-SA license information.