GitHub

This repository is for my Discrete Mathematics Final Project for creating a program to find the minimum vertex cover of a graph.

A vertex cover of a graph 𝐺 is a set, 𝑉𝑐, of vertices in 𝐺 such that every edge of 𝐺 has at least one of vertex in 𝑉𝑐 as an endpoint. This means that every vertex in the graph is touching at ...
thetechedvocate.org

5 Ways to Find the Vertex

A quadratic function is a polynomial equation of degree two which typically takes the form of y = ax^2 + bx + c, where a, b, and c are constants. The vertex of a quadratic function is the point that ...
IEEE

On the number of star samples to find a vertex or edge with given degree in a graph

Abstract: A (single) star sample of a large graph consists of a vertex, its neighbors, and the degrees of each neighbor. Estimators are derived for the expected number of star samples required to find ...
IEEE

Using expander graphs to find vertex connectivity

Abstract: The (vertex) connectivity /spl kappa/ of a graph is the smallest number of vertices whose deletion separates the graph or makes it trivial. We present the fastest known algorithm for finding ...
GitHub

Moenupa/Parallel-Vertex-Coloring

@desc Final Project: Parallel and Distributed Systems CSC458 SPRING 2024 A parallel implementation of the vertex coloring algorithm by graph partitioning, implemented in C++ using the OpenMP library.