vertex cover
Bridge-Depth Characterizes Which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel
... the Vertex Cover ...the Vertex Cover problem to an equivalent one, whose size is polynomial in the size of a pre-determined complexity parameter of ...of vertex deletions needed to ...
20
On computing the minimum 3-path vertex cover and dissociation number of graphs
... the vertex cover, namely maximal matching, depth-first search tree and linear programming, also tends to a k-approximation for the k-PVCP (we omit ...
14
Self-stabilizing Algorithms for Connected Vertex Cover and Clique Decomposition Problems
... To our knowledge, there exists no self-stabilizing algorithm for the Connected vertex cover problem. However, the approach proposed by Savage [Sav82] can be used to design a self-stabilizing algorithm. ...
27
Extension of Vertex Cover and Independent Set in Some Classes of Graphs
... Abstract We consider extension variants of the classical graph problems Vertex Cover and Inde- pendent Set. Given a graph G = (V, E) and a vertex set U ⊆ V , it is asked if there exists a minimal ...
21
Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms
... . In Section 4 we develop moderately exponential approximation algorithms for another paradigmatic problem in combinatorial optimization, the min vertex cover . Results in these two sections are obtained by ...
26
Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs
... 1.1 Previous related works The main complexity and approximability results known on this problem are the following: in [29], it is shown that MinCVC is polynomially solvable when the maximum degree of the input graph is ...
22
Complexity of Unique (Optimal) Solutions in Graphs: Vertex Cover and Domination
... optimal vertex cover, the algorithm can output it), and because for some problems it is sometimes the only available method and ...of Vertex Cover however, we can improve on Proposition 13, ...
25
Implementation and Comparison of Heuristics for the Vertex Cover Problem on Huge Graphs
... memory, vertex cover 1 Introduction The vertex cover problem [14] is a well-known classical NP-complete op- timization graph problem that has received a particular attention these last ...
13
A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs
... what extent combinatorial methods compete with linear programming for max k- vertex cover. In other words, what ratio can a purely combinatorial algorithm guarantee? To this purpose, we first devise a very ...
14
Analysis and Comparison of Three Algorithms for the Vertex Cover Problem on Large Graphs with Low Memory Capacities
... These three algorithms work deterministically on any given labeled graph. However, the labels of vertices are often totally arbitrary and only come from the application domains. Different labelings can give different ...
19
Minimum k-path vertex cover
... each vertex of H precisely once, hence H is ...a vertex vi white, if the degree of vi in H is 2, otherwise colour it ...3-path vertex cover of size ...
16
Efficient algorithms for the Max k-Vertex Cover problem
... λk-vertex cover (the former due to [8] and the latter due to Theorem 3), while the last running time corresponds to the complexity of the approach proposed in Proposition ...
14
Competitive algorithms for online matching and vertex cover problems
... By extending our previous charging scheme in a nontrivial manner, we are able to tackle the more general submodular version of online bipartite vertex cover and [r] ...
75
Total Domination, Connected Vertex Cover and Steiner Tree with Conflicts
... Universit´e Clermont Auvergne, France received 9 th June 2017, revised 20 th Sep. 2017, accepted 8 th Dec. 2017. Total Dominating Set, Connected Vertex Cover and Steiner Tree are well-known graph problems. ...
16
Parameterized Power Vertex Cover
... same vertex u, we have to count it (decrease k) only ...a vertex (with positive weight) is removed from the ...the vertex u (but do not decrease k by one yet) - initially no vertex is ...
18
Vertex-uncertainty in graph-problems
... These structural results immediately apply to several well-known problems, for instance, min vertex cover , max independent set, min coloring, max cut, max matching, etc., producing so particular results ...
22
Computing Vertex-Vertex Dissimilarities Using Random Trees: Application to Clustering in Graphs
... {kevin.dalleau,miguel.couceiro,malika.smail}@loria.fr Abstract. A current challenge in graph clustering is to tackle the issue of complex networks, i.e, graphs with attributed vertices and/or edges. In this paper, we ...
14
Computing Vertex-Vertex Dissimilarities Using Random Trees: Application to Clustering in Graphs
... Abstract. A current challenge in graph clustering is to tackle the issue of complex networks, i.e, graphs with attributed vertices and/or edges. In this paper, we present GraphTrees, a novel method that relies on ran- ...
13
Climber: A Vertex-Finder
... WTZARD, which produces accurate lire drawings of ccomlex scenes <Visior Flash forthcoring >. Wizard is capable of handling partial informatior when rroducing lire dr[r] ...
5
On corner and vertex detection
... L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignemen[r] ...
38