theory, a feedback vertex set (FVS) of a graph is a set of vertices whose removal leaves a graph without cycles ("removal" means deleting the vertex and all...

polynomial time. A closely related problem, the feedback vertex set, is a set of vertices containing at least one vertex from every cycle in a directed or undirected...

collection of vertex-disjoint cycles contained in the graph; The size of the smallest feedback vertex set in the graph: a set that contains one vertex from every...

{\text{coNP}}\subseteq {\text{NP/poly}}} . Feedback vertex set parametrized by the size of the feedback vertex set: The feedback vertex set problem has kernels with 4...

graphs Feedback vertex set, in computational complexity theory, the feedback vertex set problem is a graph-theoretical NP-complete problem Feedback (Marvel...

removing a feedback vertex set or a feedback arc set, a set of vertices or edges (respectively) that touches all cycles. However, the smallest such set is NP-hard...

connected dominating sets and feedback vertex sets in graphs of maximum degree three. A matroid can be defined from a finite set of elements and from...

a set of vertices containing at least one vertex from each directed cycle is called a feedback vertex set. A directed cycle graph has uniform in-degree 1...

the connected dominating set problem and the maximum leaf spanning tree problem.: ND2  Feedback vertex set: GT7  Feedback arc set: GT8  Graph coloring: GT4 ...

into two disjoint and independent sets U {\displaystyle U} and V {\displaystyle V} , that is, every edge connects a vertex in U {\displaystyle U} to one in...

perfect matching; Feedback vertex set number - the minimum number of vertices to delete in order to make the graph acyclic; Feedback arc set - the minimum...

(see below) and edge bipartization, feedback vertex set, cluster vertex deletion and directed feedback vertex set. It has also been used successfully...

that are knotlessly embeddable in Euclidean 3-space; graphs with a feedback vertex set of size bounded by some fixed constant; graphs with Colin de Verdière...

transform (FFT) fathoming feasible region feasible solution feedback edge set feedback vertex set Ferguson–Forcade algorithm Fibonacci number Fibonacci search...

Razgon, Igor (2008), "A fixed-parameter algorithm for the directed feedback vertex set problem", Journal of the ACM, 55 (5): 1, doi:10.1145/1411509.1411511...

S2CID 26649532. Kratsch, Dieter; Müller, Haiko; Todinca, Ioan (2003). "Feedback vertex set and longest induced path on AT-free graphs". Graph-theoretic concepts...

ordering of its vertices such that for every directed edge (u,v) from vertex u to vertex v, u comes before v in the ordering. For instance, the vertices of...

Every vertex in G either belongs to D or is adjacent to a vertex in D. That is, D is a dominating set of G. A minimum connected dominating set of a graph...

precision scaling. Weight map A set of Vertex attributes controlling deformation of a 3D model during skeletal animation. Per-vertex weights are assigned to control...

bidimensionality, it was shown that feedback vertex set, vertex cover, connected vertex cover, cycle packing, diamond hitting set, maximum induced forest, maximum...

optimization) Clique (see also independent set problem) Set packing Vertex cover Set covering Feedback node set Feedback arc set Directed Hamilton circuit (Karp's...

(corporate goals). The employer can observe the implementation of continuous feedback in the target agreement process, continuing to the performance level of...

a matching game in which players form sequences of tile pairings, and Vertex, in which players connect vertices to assemble an image. In January 2022...

graph is a mapping from the vertex set to the natural numbers, a coloring of a signed graph is a mapping from the vertex set to the integers. The constraints...

choose any one vertex v {\displaystyle v} to be part of this subtournament, and form the rest of the subtournament recursively on either the set of incoming...

graph. An assignment to a label cover instance gives to each vertex of G a value in the set [k] = {1, 2, ... k}, often called “colours.” An instance of...

the square's vertices, together with a line segment connecting the fourth vertex to the center. Ross Honsberger credits its discovery to Maurice Poirier...

elements of a partially ordered set (the vertices of the graph, with the reachability ordering on the vertex set) into layers (sets of vertices with the same...

example, Floyd–Warshall algorithm, the shortest path between a start and goal vertex in a weighted graph can be found using the shortest path to the goal from...

graph theory, the dual graph of a planar graph G is a graph that has a vertex for each face of G. The dual graph has an edge for each pair of faces in...