Results 281 to 290 of about 2,495,395 (314)

Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity

International/Italian Conference on Algorithms and Complexity, 2021
For intractable problems on graphs of bounded treewidth, two graph parameters treedepth and vertex cover number have been used to obtain fine-grained complexity results.
Tatsuya Gima, T. Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Y. Otachi   +4 more
semanticscholar   +1 more source

Optimal lower bounds for matching and vertex cover in dynamic graph streams

Cybersecurity and Cyberforensics Conference, 2020
In this paper, we give simple optimal lower bounds on the one-way two-party communication complexity of approximate Maximum Matching and Minimum Vertex Cover with deletions. In our model, Alice holds a set of edges and sends a single message to Bob.
J. Dark, C. Konrad
semanticscholar   +1 more source

Dismantling and Vertex Cover of Network Through Message Passing

IEEE Transactions on Circuits and Systems - II - Express Briefs, 2020
The dismantling problem and minimum vertex cover (MVC) problem of network are two fundamental NP-hard problems where the former aims to find a minimal subset of nodes whose removal leaves the network broken in small components of sub-extensive size and ...
Dawei Zhao, Shumian Yang, Xiaohui Han, Shuhui Zhang, Zhen Wang   +4 more
semanticscholar   +1 more source

Metric Dimension and Geodetic Set Parameterized by Vertex Cover

Symposium on Theoretical Aspects of Computer Science
For a graph $G$, a subset $S\subseteq V(G)$ is called a resolving set of $G$ if, for any two vertices $u,v\in V(G)$, there exists a vertex $w\in S$ such that $d(w,u)\neq d(w,v)$. The Metric Dimension problem takes as input a graph $G$ on $n$ vertices and
Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, P. Tale   +6 more
semanticscholar   +1 more source

Potential Game Theoretic Learning for the Minimal Weighted Vertex Cover in Distributed Networking Systems

IEEE Transactions on Cybernetics, 2019
Toward the minimal weighted vertex cover (MWVC) in agent-based networking systems, this paper recasts it as a potential game and proposes a distributed learning algorithm based on relaxed greed and finite memory.
Changhao Sun, Wei Sun, Xiaochu Wang, Qingrui Zhou   +3 more
semanticscholar   +1 more source

A Note on Max k-Vertex Cover: Faster FPT-AS, Smaller Approximate Kernel and Improved Approximation

SIAM Symposium on Simplicity in Algorithms, 2018
In Maximum $k$-Vertex Cover (Max $k$-VC), the input is an edge-weighted graph $G$ and an integer $k$, and the goal is to find a subset $S$ of $k$ vertices that maximizes the total weight of edges covered by $S$. Here we say that an edge is covered by $S$
Pasin Manurangsi
semanticscholar   +1 more source

Elimination Distances, Blocking Sets, and Kernels for Vertex Cover

Symposium on Theoretical Aspects of Computer Science, 2019
The Vertex Cover problem plays an essential role in the study of polynomial kernelization in parameterized complexity, i.e., the study of provable and efficient preprocessing for NP-hard problems.
Eva-Maria C. Hols, Stefan Kratsch, A. Pieterse   +2 more
semanticscholar   +1 more source

A new robust approach to solve minimum vertex cover problem: Malatya vertex-cover algorithm

Journal of Supercomputing, 2023
Selman Yakut, Furkan Öztemiz, A. Karcı
semanticscholar   +1 more source

Digitally Annealed Solution for the Vertex Cover Problem with Application in Cyber Security

IEEE International Conference on Acoustics, Speech, and Signal Processing, 2019
Cyber attacks on the power systems can mislead the control center to produce incorrect state and topology estimate. State and topology attacks can have harmful impacts on the operation of a power system.
Mohammad Javad-Kalbasi, Keivan Dabiri, S. Valaee, A. Sheikholeslami   +3 more
semanticscholar   +1 more source