• No results found

feedback vertex set problem

An Algorithm for the Feedback Vertex Set Problem on a Normal Helly Circular Arc Graph

An Algorithm for the Feedback Vertex Set Problem on a Normal Helly Circular Arc Graph

... The feedback vertex set (FVS) problem is to find the set of vertices of minimum cardinality whose removal renders the graph ...FVS problem has applications in several areas such ...

9

On group feedback Vertex Set parameterized by the size of the cutset

On group feedback Vertex Set parameterized by the size of the cutset

... Group Feedback Vertex Set problem even for infinite groups for which the word problem, ...the problem of checking whether results of two sequences of multiplications are equal, ...

15

Faster deterministic feedback vertex set

Faster deterministic feedback vertex set

... The Feedback Vertex Set problem ( FVS for short), where we ask to delete as few vertices as possible from a given undirected graph to make it acyclic, is one of the fundamental graph problems, ...

7

Simple Proof of Hardness of Feedback Vertex Set

Simple Proof of Hardness of Feedback Vertex Set

... The Feedback Vertex Set problem (FVS), where the goal is to find a small subset of vertices that intersects every cycle in an input directed graph, is among the fundamental problems whose ...

11

The Upper Total Edge Domination Number of a Graph

The Upper Total Edge Domination Number of a Graph

... dominating set in a connected graph is called a minimal total edge dominating set if no proper subset of is a total edge dominating set of ...

6

Assessment of substitutive vibrotactile feedback for performing object manipulation task with prosthetics

Assessment of substitutive vibrotactile feedback for performing object manipulation task with prosthetics

... The loss of a limb is a tragic event that comes with the loss of some vital abilities, like grasping or feeling touch. Artificial limbs, or prosthetics, allow amputees to regain some of these abilities, with increasing ...

25

International Journal of Scientific Research and Reviews The Upper Total Edge Domination Number of a Graph

International Journal of Scientific Research and Reviews The Upper Total Edge Domination Number of a Graph

... dominating set in a connected graph is called a minimal total edge dominating set if no proper subset of is a total edge dominating set of ...

6

(G,D)-Bondage and (G,D)-Nonbondage Number of a Graph

(G,D)-Bondage and (G,D)-Nonbondage Number of a Graph

... a vertex 𝑣 in a graph 𝐺 is defined to be the number of edgesincident with 𝑣 and is denoted by ...A vertex of degree zero is an isolated vertex and a vertex of degree one is a pendant ...

6

ON TOTAL VERTEX-EDGE DOMINATION

ON TOTAL VERTEX-EDGE DOMINATION

... dominating set, if every vertex in G either is element of S or is adjacent to at least one vertex in ...dominating set in ...domination set if every vertex of S has a neighbor in ...

6

Definition 1.2: Let be a graph with vertices. A bijection

Definition 1.2: Let be a graph with vertices. A bijection

... has vertex set 𝑉 = 𝑉(𝐺) and the edge set 𝐸 = 𝐸(𝐺). The set of vertices adjacent to a vertex 𝑢 of 𝐺 is denoted by ...labeling problem can be found in [4] ...

10

Two New Exact Methods for the Vertex Separation Problem

Two New Exact Methods for the Vertex Separation Problem

... In this paper we have faced the vertex separation problem (VSP). In particular, we extend the available exact methods with one based on a new integer linear programming (IP) formulation (named as IPVSP) and ...

11

Algorithm for the Vertex Connectivity Problem on Circular Trapezoid Graphs

Algorithm for the Vertex Connectivity Problem on Circular Trapezoid Graphs

... The rest of this paper is organized as follows. Section 2 describes some defini- tions of circle trapezoid graphs and models and introduces the extended circle trapezoid model, as well as some notations. Section 3 ...

8

THE STRONG (WEAK) VV-DOMINATING SET OF A GRAPH

THE STRONG (WEAK) VV-DOMINATING SET OF A GRAPH

... |𝑆| = 𝑛. Now, to prove the equality, suppose there is such a non support cutvertex u and let S be the set of all cutvertices of G other than u. It is clear that vertices incident with any block not incident with u ...

10

Set Covering Problem with Conflict Constraints.

Set Covering Problem with Conflict Constraints.

... mixed set covering, packing, and partitioning problem and develop new classes of ...this problem is ...optimization problem, in order to enhance the computational effectiveness of the B&B ...

139

Fine grained Entity Set Refinement with User Feedback

Fine grained Entity Set Refinement with User Feedback

... a set of candidate named entities represented by vectors of features, the goal of set refinement is to find a subset of entities which are similar to the target concept, based on a cer- tain similarity ...

5

Optimizing Grammars for Minimum Dependency Length

Optimizing Grammars for Minimum Dependency Length

... As a test of whether this model is adequate to represent English word order, we extracted weights for the Wall Street Journal corpus, used them to re- order the same set of sentences, and tested how often words ...

8

A New General Parser for Extensible Languages

A New General Parser for Extensible Languages

... major problem with the multipass method is that for each vertex iteration in a pass, rules are being matched against paths that contain vertices that have not been examined in the current ...

7

Relatively prime dominating polynomial in graphs

Relatively prime dominating polynomial in graphs

... dominating set of size n + 1 is obtained by selecting the vertex sets C and D and the vertex v and the vertex sets C and D, any one of the vertex from B ∪ ...

8

Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs

Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs

... Independent Set are two of the most well-studied NP-complete ...independent set of a graph is a set of vertices no two of which are connected by an edge, and that a vertex cover is a ...

17

Problem Set 1

Problem Set 1

... specific problem is being solved by improving pilot training to comply with RAs and refin- ing the TCAS algorithms, related problems are likely to surface as unmanned aircraft and enhanced collision avoidance ...

44

Show all 10000 documents...

Related subjects