A Survey on the <i>k</i>-Path Vertex Cover Problem by Jianhua Tu

Subjects: “…<i>k</i>-path vertex cover problem…”
Get full text

Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover by Ghaffari, Mohsen, Gouleakis, Themistoklis, Konrad, Christian, Mitrović, Slobodan, Rubinfeld, Ronitt

“… • Our O(log log n)-round (2 + ε)-approximate minimum vertex cover algorithm improves on an O(log log n)-round O(1)approximation of Assadi et al. …”
Get full text

An improved algorithm for the vertex cover $P_3$ problem on graphs of bounded treewidth by Zongwen Bai, Jianhua Tu, Yongtang Shi

“…Given a graph $G=(V,E)$ and a positive integer $t\geq2$, the task in the vertex cover $P_t$ ($VCP_t$) problem is to find a minimum subset of vertices $F\subseteq V$ such that every path of order $t$ in $G$ contains at least one vertex from $F$. …”
Get full text

TIVC: An Efficient Local Search Algorithm for Minimum Vertex Cover in Large Graphs by Yu Zhang, Shengzhi Wang, Chanjuan Liu, Enqiang Zhu

Subjects: “…minimum vertex cover (MVC)…”
Get full text

MEAMVC: A Membrane Evolutionary Algorithm for Solving Minimum Vertex Cover Problem by Ping Guo, Changsheng Quan, Haizhu Chen

Subjects: Get full text

TS-Reconfiguration of $k$-Path Vertex Covers in Caterpillars for $k \geq 4$ by Duc A. Hoang

“…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. …”
Get full text

A Fast and Robust Heuristic Algorithm for the Minimum Weight Vertex Cover Problem by Yang Wang, Zhipeng Lu, Abraham P. Punnen

Subjects: Get full text

Dimension Incremental Feature Selection Approach for Vertex Cover of Hypergraph Using Rough Sets by Qian Zhou, Xiaolin Qin, Xiaojun Xie

Subjects: “…Vertex cover…”
Get full text

A near-Optimal Sublinear-Time Algorithm for Approximating the Minimum Vertex Cover Size by Onak, Krzysztof, Ron, Dana, Rosen, Michal, Rubinfeld, Ronitt

“…We give a nearly optimal sublinear-time algorithm for approximating the size of a minimum vertex cover in a graph G. The algorithm may query the degree deg(v) of any vertex v of its choice, and for each 1 ≤ i ≤ deg(v), it may ask for the i[superscript th] neighbor of v. …”
Get full text
Get full text

Self-Stabilizing Capacitated Vertex Cover Algorithms for Internet-of-Things-Enabled Wireless Sensor Networks by Yasin Yigit, Orhan Dagdeviren, Moharram Challenger

Subjects: Get full text

Two Heuristic Algorithms for the Minimum Weighted Connected Vertex Cover Problem Under Greedy Strategy by Qipeng Xie, Yuchao Li, Sengui Hu, Yue Zhu, Hongqiang Wang

Subjects: “…Minimum weighted connected vertex cover problem…”
Get full text

An Efficient Polynomial Time Approximation Scheme for the Vertex Cover P3 Problem on Planar Graphs by Tu Jianhua, Shi Yongtang

Subjects: Get full text

Vertex cover on graph with perfect matching(具有完美匹配的图的顶点覆盖问题) by JINZhen(金珍), WANLong(万龙)

Get full text

Weakly Completely Prime Graph by ameer al-swidi, Ahmed A.Omran

Subjects: “…weakly c-prime ideal, subtractive ideal, nilpotent, vertex cover, preserve vertex cover, homomorphism of graphs…”
Get full text

A Travelling Wave-Based Fault Location Strategy Using the Concepts of Metric Dimension and Vertex Covers in a Graph by Elizabeth C. M. Maritz, Jacques M. Maritz, Moslem Salehi

Subjects: Get full text

Weighted Connected Vertex Cover Based Energy-Efficient Link Monitoring for Wireless Sensor Networks Towards Secure Internet of Things by Zuleyha Akusta Dagdeviren

Subjects: Get full text

Reducing the rank of a matroid by Gwenaël Joret, Adrian Vetta

Subjects: “…maximum vertex cover…”
Get full text

Remarks on Dynamic Monopolies with Given Average Thresholds by Centeno Carmen C., Rautenbach Dieter

Subjects: Get full text

On the Optimal Lawful Intercept Access Points Placement Problem in Hybrid Software-Defined Networks by Xiaosa Xu, Wen-Kang Jia, Yi Wu, Xufang Wang

Subjects: Get full text

Efficient Processing of <i>k</i>-Hop Reachability Queries on Directed Graphs by Xian Tang, Junfeng Zhou, Yunyu Shi, Xiang Liu, Keng Lin

Subjects: Get full text