Carousel Greedy R implementation for the Minimum Vertex Cover Problem

Read full text Summarise with VIRAT
Authors: Raffaele Dragone
Cited by: 0

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

This capsule provides a reproducible R implementation of the Carousel Greedy algorithm applied to the Minimum Vertex Cover problem. The capsule contains the source code of the algorithm, a sample instance, and a script that executes the solver and reproduces the computational results. Running the capsule will automatically execute the algorithm on the provided graph instance and print the solution statistics. Contents: - R implementation of the Carousel Greedy algorithm - Example graph instance - Script to reproduce the experiment This capsule accompanies the article submitted to Software Impacts.

Fields of Study & Subjects

Complexity and Algorithms in Graphs Advanced Graph Theory Research Graph Theory and Algorithms

Publication details

Journal / source
Code Ocean
Publication date
1 January 2026
Language
EN