Vertex cover problem
Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs
... connected vertex cover problem, denoted by MinCVC, is the variation of the vertex cover problem where, given a connected graph G = (V, E), we seek a vertex cover S ...
22
Analysis and Comparison of Three Algorithms for the Vertex Cover Problem on Large Graphs with Low Memory Capacities
... for Vertex Covering. Many algorithms have been proposed for the vertex cover ...a vertex of maximum degree and delete this vertex and its incident edges from the graph, until all edges ...
19
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 ...
13
Efficient algorithms for the Max k-Vertex Cover problem
... k-vertex cover problem a graph G(V, E) with |V | = n vertices 1, ...k-vertex cover can be defined as follows: “given G, k and parameter ℓ, does G contain k vertices that cover at ...
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 ...
27
A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs
... k-vertex cover problem in bipartite graphs and propose a purely com- binatorial algorithm that beats the only such known algorithm, namely the greedy ...
14
On computing the minimum 3-path vertex cover and dissociation number of graphs
... Although the algorithm D3PVC approximates the 3-PVCP with a factor less than 2.5, its time complexity is exponential in maximum degree of the graph. However, graphs with a large maximum degree can be resolved more ...
14
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 ...
20
Minimum k-path vertex cover
... k-path vertex cover of size at most t can be expressed in the monadic second order logic, by famous Courcelle’s theorem [8], the minimum k-path vertex cover problem can be solved in ...
16
On-line algorithm for the minimal b-clique cover problem in interval graphs
... b-clique cover problem. The off-line version of the minimal clique cover is solved in polynomial time for chordal graphs [9,5], consequently for interval ...same problem is also solved in ...
8
Tight Bounds on Vertex Connectivity Under Vertex Sampling
... As in the case of edge connectivity, studying the ver- tex connectivity of the subgraph obtained by independently sampling vertices of a k-vertex-connected graph is of fun- damental interest. However, progress in ...
14
SAVE - Simulated Annealing Applied to the Vertex Elimination Problem in Computational Graphs
... 101 - 54602 Villers lès Nancy Cedex France Unité de recherche INRIA Rennes : IRISA, Campus universitaire de Beaulieu - 35042 Rennes Cedex France Unité de recherche INRIA Rhône-Alpes : 65[r] ...
28
Reoptimization of the Maximum Weighted Pk-Free Subgraph Problem under Vertex Insertion
... weighted vertex cover and min weighted set cover problems, are discussed in a similar setting up to the fact that perturbations there concerned the edge-set of the initial ...superstring ...
12
Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms
... 7 max set packing, max clique and max bipartite subgraph We show in this section how the results obtained in previous sections can be applied also to ap- proximate other combinatorial problems. Let us first note that ...
26
A new efficient RLF-like algorithm for the vertex coloring problem
... The most popular fast heuristics for the VCP are based on greedy constructive procedures. These algorithms sequentially color the vertices following some rule for choosing the next vertex to color and the color to ...
17
Cover Art
... Front Cover: Untitled While the artist prefers to let people create their own interpretations of his paintings, he offers these brief highlights of the illustration. Although life is a net in which people depend ...
1
Cover Art
... COVER ART S erving a life sentence in prison, Peter Collins knew he had to come to terms with the consequences of his actions and so dedicated himself to working for positive social ...
1
Cover Art
... 95 COVER ART Peter Collins was a writer, artist, musician, cartoonist, activist, fi lmmaker, organizer and prisoners’ rights advocate. Peter was a social critic who offered thoughtful insights about the structures ...
1
Cover Art
... The Cover Art When I rst saw a photo of this tearful Tibetan child, I wanted to draw her. There is something of the universal human condition in her beauty and sadness. I have juxtaposed the characters ...
1
Cover Art
... Front Cover: Rising Salts (2004) Acrylic on Canvas 1.13 m x.685 m This painting should be viewed as looking from the sky. The green and brown background is the ground and bush; the white is the salt that is taking ...
1