DCEL / Triangulation of Polygon / Vertex Guard Problem / 3 coloring
-
Updated
Apr 6, 2018 - Jupyter Notebook
#
3-coloring
Here are 5 public repositories matching this topic...
An analysis of a NP-Complete Graph Colouring problem 3-Colourability and an approximate algorithm analysis that solves 3-COL.
algorithms heuristics algorithm-analysis greedy-algorithms nphard heuristic-algorithm 3-coloring 3-colorability-problem npcomplete
-
Updated
May 18, 2018 - C++
Understanding and implementation of the algorithm to get three-coloring in triangle-free planar graphs
-
Updated
Apr 29, 2021 - TeX
Proof Based Algorithms HW (CPSC 365) with Professor Andre Wibisono
machine-learning gale-shapley network-flow binary-tree dynamic-programming greedy-algorithms knapsack-problem k-nearest-neighbours divide-and-conquer fastfouriertransform scheduling-problem matching-algorithm traveling-salesman-problem 3-coloring graphs-theory time-complexity-analysis min-cut-algorithm np-problems np-reduction monge-arrays
-
Updated
Aug 11, 2024
A fast algorithm for solving the Graph Coloring problem and its generalizations (Bandwidth Coloring, Multi Coloring, and Bandwidth Multi Coloring problems)
-
Updated
Sep 2, 2023 - C
Improve this page
Add a description, image, and links to the 3-coloring topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the 3-coloring topic, visit your repo's landing page and select "manage topics."