Minimum colored maximum matching is NP-hard on trees
Texte intégral
Documents relatifs
A b-coloring of a graph G by k colors is a proper coloring of the vertices of G such that every color class contains a vertex that is adjacent to all the other k− 1 color classes..
In these three problems we ask whether it is possible to choose the right order in which the intersection of several automata must be performed in order to minimize the number
Balls with a thick border belong to any minimum covering; any two circled points cannot be covered by a single ball. Note that this object and its decomposition are invariant
It is strongly NP -hard to compute a minimizer for the problem (k-CoSP p ), even under the input data restric- tions specified in Theorem 1.. Clearly, if a minimizer was known, we
Yet, even if supertree methods satisfy some desirable properties, the inferred supertrees often contain polytomies which actually intermix two distinct phenomena: either a lack
In fact, we will prove that any instance of a problem Π in NP (expressed as described previously) can be transformed in polynomial time into a CNF (i.e., an instance of SAT ) in such
For approximate solution to Minimum edge-colored Maximum Matching, since finding a regular maximum matching is easy, one could spontaneously think of using the number of colors of
At any time during the execution of the algorithm, consider any edge e = [u, v], and let us denote by p u (resp. v) gets at most one additional color until the end of the Phase I of