DCEL / Triangulation of Polygon / Vertex Guard Problem / 3 coloring
-
Updated
Apr 6, 2018 - Jupyter Notebook
DCEL / Triangulation of Polygon / Vertex Guard Problem / 3 coloring
An experimental greedy heuristic for graph 3-coloring using a custom Matrix Sorting Machine priority structure, with benchmarking and graph visualization.
An analysis of a NP-Complete Graph Colouring problem 3-Colourability and an approximate algorithm analysis that solves 3-COL.
Understanding and implementation of the algorithm to get three-coloring in triangle-free planar graphs
This project provides an interactive visualization of the methodology to optimally solve the Art Gallery/Street Light Placement problem on a simple polygon.
Python project on graph theory and computational complexity, solving SAT formulas and graph 3-coloring problems using brute-force search, CNF encoding, SAT solvers, and polynomial reduction
A fast algorithm for solving the Graph Coloring problem and its generalizations (Bandwidth Coloring, Multi Coloring, and Bandwidth Multi Coloring problems)
Proof Based Algorithms HW (CPSC 365) with Professor Andre Wibisono
Add a description, image, and links to the 3-coloring topic page so that developers can more easily learn about it.
To associate your repository with the 3-coloring topic, visit your repo's landing page and select "manage topics."