Problem: Weighted feedback vertex set

Definition:
Input: A graph G in this class with weight function on the vertices and a real k.
Output: True iff G contains a set S of vertices, such that the sum of the weights of the vertices in S is at most k and every cycle in G contains a vertex from S.

Linear

back to top

Polynomial

back to top

GI-complete

back to top

NP-hard

back to top

NP-complete

back to top

coNP-complete

back to top

Open

back to top

Unknown to ISGCI

back to top

AltStyle によって変換されたページ (->オリジナル) /