Results 11 to 20 of about 2,495,395 (314)
Approximately: Independence Implies Vertex Cover [PDF]
arXiv.org, 2023 $\newcommand{\eps}{\varepsilon}$ We observe that a $(1-\eps)$-approximation algorithm to Independent Set, that works for any induced subgraph of the input graph, can be used, via a polynomial time reduction, to provide a $(1+\eps)$-approximation to ...
Sariel Har-Peled
semanticscholar +1 more source
The Complexity of Temporal Vertex Cover in Small-Degree Graphs [PDF]
AAAI Conference on Artificial Intelligence, 2022 Temporal graphs naturally model graphs whose underlying topology changes over time. Recently, the problems Temporal Vertex Cover (or TVC) and Sliding-Window Temporal Vertex Cover (or Delta-TVC for time-windows of a fixed-length Delta) have been ...
Thekla Hamm +3 more
semanticscholar +1 more source
An adaptive greedy repair operator in a genetic algorithm for the minimum vertex cover problem
AIMS MathematicsA genetic algorithm (GA) evolves the population of candidate solutions to a particular problem through crossover and mutation operators. Since a newly generated solution may not satisfy the constraints of the given problem, it is common to penalize ...
Seung-Hyun Moon, Yourim Yoon
doaj +2 more sources
Vertex decomposability of complexes associated to forests [PDF]
Transactions on Combinatorics, 2022 In this article, we discuss the vertex decomposability of three well-studied simplicial complexes associated to forests. In particular, we show that the bounded degree complex of a forest and the complex of directed trees of a multidiforest is ...
Anurag Singh
doaj +1 more source
Time-Optimal Sublinear Algorithms for Matching and Vertex Cover [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2021 We study the problem of estimating the size of maximum matching and minimum vertex cover in sub linear time. Denoting the number of vertices by $n$ and the average degree in the graph by $\overline{d}$, we obtain the following results for both problems ...
Soheil Behnezhad
semanticscholar +1 more source
On The Study of Edge Monophonic Vertex Covering Number
Ratio Mathematica, 2022 For a connected graph G of order n ≥ 2, a set S of vertices of G is an edge monophonic vertex cover of G if S is both an edge monophonic set and a vertex covering set of G.
K.A Francis Jude Shini +3 more
doaj +1 more source
Stochastic Vertex Cover with Few Queries [PDF]
ACM-SIAM Symposium on Discrete Algorithms, 2021 We study the minimum vertex cover problem in the following stochastic setting. Let $G$ be an arbitrary given graph, $p \in (0, 1]$ a parameter of the problem, and let $G_p$ be a random subgraph that includes each edge of $G$ independently with ...
Soheil Behnezhad +2 more
semanticscholar +1 more source
Better Approximation for Distributed Weighted Vertex Cover via Game-Theoretic Learning
IEEE Transactions on Systems, Man, and Cybernetics: Systems, 2022 Toward better approximation for the minimum-weighted vertex cover (MWVC) problem in multiagent systems, we present a distributed algorithm from the perspective of learning in games.
Changhao Sun +6 more
semanticscholar +1 more source
Parameterized Power Vertex Cover [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 We study a recently introduced generalization of the Vertex Cover (VC) problem, called Power Vertex Cover (PVC). In this problem, each edge of the input graph is supplied with a positive integer demand.
Eric Angel +3 more
doaj +1 more source
Computer Science, 2022 The graph is a data structures and models that used to describe many real-world problems. Many engineering problems, such as safety and transportation, have a graph-like structure and are based on a similar model.
A. Karcı, Selman Yakut, Furkan Öztemiz
semanticscholar +1 more source