Results 11 to 20 of about 2,372,931 (298)
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
Parallel Vertex Cover Algorithms on GPUs [PDF]
IEEE International Parallel and Distributed Processing Symposium, 2022 Finding small vertex covers in a graph has applications in numerous domains such as scheduling, computational biology, telecommunication networks, artificial intelligence, social science, and many more.
Peter Yamout +4 more
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
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
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
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
TS-Reconfiguration of $k$-Path Vertex Covers in Caterpillars for $k \geq 4$
Theory and Applications of Graphs, 2023 A k-path vertex cover (k-PVC) of a graph G is a vertex subset I such that each path on k vertices in G contains at least one member of I. Imagine that a token is placed on each vertex of a k-PVC.
Duc A. Hoang
doaj +1 more source
Approximation Algorithm for Vertex Cover with Multiple Covering Constraints
Algorithmica, 2021 We consider the vertex cover problem with multiple coverage constraints in hypergraphs. In this problem, we are given a hypergraph G=(V,E)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb ...
Eunpyeong Hung, Mong-Jen Kao
semanticscholar +1 more source
A Massively Parallel Algorithm for Minimum Weight Vertex Cover [PDF]
ACM Symposium on Parallelism in Algorithms and Architectures, 2020 We present a massively parallel algorithm, with near-linear memory per machine, that computes a (2+ε)-approximation of minimum-weight vertex cover in O(log log d) rounds, where d is the average degree of the input graph.
M. Ghaffari, Ce Jin, Daan Nilis
semanticscholar +1 more source