Results 291 to 300 of about 2,495,395 (314)
Some of the next articles are maybe not open access.

Applying the quantum approximate optimization algorithm to the minimum vertex cover problem

Applied Soft Computing, 2022
Y.J. Zhang   +8 more
semanticscholar   +1 more source

Asymmetric Game: A Silver Bullet to Weighted Vertex Cover of Networks

IEEE Transactions on Cybernetics, 2018
Weighted vertex cover (WVC), a generalized type of vertex cover, is one of the most important combinatorial optimization problems. In this paper, we provide a novel solution to the WVC problem from the view of network engineering.
Changbing Tang, Ang Li, Xiang Li
semanticscholar   +1 more source

Approximating Bipartite Minimum Vertex Cover in the CONGEST Model

International Conference on Principles of Distributed Systems, 2020
Salwa Faour, F. Kuhn
semanticscholar   +1 more source

Bridge-Depth Characterizes which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel

International Colloquium on Automata, Languages and Programming, 2020
Marin Bougeret, B. Jansen, Ignasi Sau
semanticscholar   +1 more source

Thinking Like a Vertex

ACM Computing Surveys, 2015
Tim Weninger
exaly  

Home - About - Disclaimer - Privacy