DAA | Approximation Algorithm Vertex Cover - javatpoint
Lower Bounds
Mathematics | Free Full-Text | An Exact Algorithm for Minimum Vertex Cover Problem
A New Lower Bound for the Eternal Vertex Cover Number of Graphs | SpringerLink
Intro to Algorithms: CHAPTER 37: APPROXIMATION ALGORITHMS
Mathematics | Free Full-Text | Domination Coloring of Graphs
Introduction and Approximate Solution for Vertex Cover Problem - GeeksforGeeks
Eulerian path - Wikipedia
graphs - Error lower-bound for an algorithm for vertex cover - Computer Science Stack Exchange
Analyze Geospatial Data in Python: GeoPandas and Shapely – LearnDataSci
Graph coloring - Wikipedia
Travelling Salesman Problem using Branch and Bound | Techie Delight
New Lower Bounds on the Maximum Number of Minimal Connected Vertex Covers
L15_ApproxAlgs
An Exact Algorithm for Minimum Vertex Cover Problem
approximation - How are matchings a lower bound for an approximate vertex cover? - Computer Science Stack Exchange
A substructure based lower bound for eternal vertex cover number - ScienceDirect
Graph hierarchy: a novel framework to analyse hierarchical structures in complex networks | Scientific Reports
A new lower bound for the eternal vertex cover number of graphs | SpringerLink
35.1 The vertex-cover problem
PDF) An Exact Algorithm for Minimum Vertex Cover Problem
ICS 46 Spring 2022, Notes and Examples: Graph Connectedness
Introduction to Complexity — Foundations of Computer Science 0.3 documentation
Introduction and Approximate Solution for Vertex Cover Problem - GeeksforGeeks
