Vertex Cover
Deterministically maintaining a (2 + ∊) approximate minimum vertex cover in O(1/∊2) amortized update time
... minimum vertex cover 1 in ...mum vertex cover, it is easy to show that the set V (M ) forms a 2-approximate minimum vertex cover in ...minimum vertex cover in ...
15
Deterministic fully dynamic data structures for vertex cover and matching
... minimum vertex cover, on the other hand, is ...minimum vertex cover (by using the endpoints of the maximal ...minimum vertex cover cannot be efficiently approximated within any ...
21
Deterministic fully dynamic data structures for vertex cover and matching
... In Section 2.5, we present a detailed implementation of our algorithm using the data structures described in Section 2.3. In Section 2.6, we prove that for any ∈ [0, 1], α = 1 + 3 and β = 1 + , it takes O(t log n/ 2 ) ...
43
Graph Characteristics and Branch-and-Reduce Algorithms for Minimum Vertex Cover.
... make it very difficult to implement these types of algorithms correctly. As a result, the practicality of branching algorithms needs to be studied further. To this end, Akiba and Iwata [AI16] imple- ment a branching ...
87
Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs
... Vertex Cover and Independent Set are two of the most well-studied NP-complete ...a vertex cover is a set of vertices that contains at least one endpoint of every edge (or equivalently, the ...
17
Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) update time
... Our algorithm builds and simplifies the framework of hierarchical partitioning of vertices proposed by Onak and Rubinfeld [13], which was later enhanced by Bhattacharya, Henzinger and Italiano [5] to give a deter- ...
15
Parameterized streaming : maximal matching and vertex cover
... In this paper, we introduce a new approach to han- dling graph streams, by instead seeking solutions for the parameterized versions of these problems. Here, we are given a parameter k and the objective is to decide ...
19
On cutwidth parameterized by vertex cover
... smallest vertex cover of the input graph G. A vertex cover of G is a vertex set S such that every edge of G has at least one endpoint in ...smallest vertex cover of ...
15
Temporal vertex cover with a sliding time window
... problem Vertex Cover . In our first problem, Temporal Vertex Cover , the aim is to cover every edge at least once during the lifetime of the temporal graph, where an edge can only be ...
21
Fully dynamic approximate maximum matching and minimum vertex cover in O(log3 n) worst case update time
... Fix any constant 0 < < 1 and let β = 3(2 + )/. Then β ≥ 5 and 2/f(β) = 2 + (see equation 3.5). Setting β in this way, we can use Theorem 3.1 and Lemma 3.1 to maintain a (2+ )-approximate maximum fractional matching ...
21
Frugality Ratios and Improved Truthful Mechanisms for Vertex Cover
... and vertex-cover ...the vertex cover problem and bound its frugality ...and vertex-cover ...for vertex-cover auctions via a boot- strapping technique, which may be ...
10
NFA reduction via hypergraph vertex cover approximation
... minimum vertex cover problem on the class of k-partite k- uniform ...minimal vertex cover on 3-partite 3-uniform hypergraphs, which is ...approximating vertex cover on k-partite ...
67
An Efficient Heuristic Algorithm for Solving Connected Vertex Cover Problem in Graph Theory
... To evaluate the benefit of adding v to the current solution, a greedy function score(v) is designed, which is quite important for the construction of RCL as well. In order to introduce the greedy function, we firstly ...
12
Vertex Sparsification for Edge Connectivity
... of vertex reduction / elim- ination based graph ...of vertex and edge sparsifi- ...sparse vertex elimination has a multitude of advantages: they are readily parallelizable [46], and can be more ...
20
Vertex Removable Cycles of Graphs and Digraphs
... the vertex removable cycle in respect to the following, if ℑ is a class of graphs(digraphs) satis- fying a certain property, G ∈ ℑ , the cycle C in G is called vertex removable if G−V (C) ∈ ...The ...
9
Independent sets in vertex arrival streams
... In the “implicit” vertex model, the input stream consists of a sequence of objects, one per vertex. The algorithm is equipped with a function that maps pairs of objects to the presence or absence of edges, ...
15
Some Results on Vertex Equitable Labeling
... 4 , the wheel W n , the complete g K if n > 3 and triangular cactus with q edges where q 0 or 6 or 9 mod 12 are not vertex equitable. Moreover they proved that if G is a graph with p vertices and q edges, ...
7
New Results on Vertex Prime Graphs
... a vertex prime labeling and a 2 – regular graph with atleast two odd cycles does not have a vertex prime ...a vertex prime labeling if and only if it does not have two odd ...
5
The PI and vertex PI polynomial of dendimers
... The mathematical properties of these topological indices can be found in some recent papers [920].In this paper, our notation is standard and taken mainly from the standard book of graph theory. The goal of this article ...
7
Vertex maps on graphs-trace theorems
... In both Sharkovsky ’ s Theorem and the theorem on trees there is a result that is sometimes called the converse. This is the result that given any n in the ordering one can find an example of a vertex map that ...
11