The issue of top coating
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.
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.
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.
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.