greedy graph-coloring algorithm that can be used in timetable scheduling
-
Updated
May 24, 2022 - Python
greedy graph-coloring algorithm that can be used in timetable scheduling
DKE project 1.1
Developing the final project of 2019.1 class of Graphs, at IMD/UFRN. Implementing DSATUR's algorithm.
Distributed Computing | Rank-Based Graph Coloring
Basic graph editor with coloring algorithm support
BIS(G²) (Basic Integrated System [Graph * Generator]). Projeto 3/3 da Disciplina de Teoria dos Grafos do curso de bacharelado em Ciência da Computação da URSA - Faculdade RSá.
Graph Coloring investigation project for Discrete Mathematics at Olin College, Fall 2018
Chromatic Graph Theory project - fold graph coloring
Solução de puzzle Sudoku 9x9 com cores 1,2,..,9 utilizando algoritmo para coloração minima de grafos com backtracking e indice cromático 9
🌈 Trabalho Prático 3 - AEDs III
The Minimum Graph Coloring Problem using exact algorithms along with heuristics and metaheuristics.
A graph coloring visualization application in .NET
The implementation of the paper Solving the Latin Square Completion Problem by Memetic Graph Coloring
[DEPRECATED: please see https://aalok-sathe.gitlab.io/libcolgraph for new version] // a speedy library written in C++ wrapped to provide a Python interface and a useful web GUI for graph coloring research
Distributed coloring algorithm with jBotSim in java.
Algorithmic Graph Theory CA3
Алгоритм раскраски рёбер графа для практикума 5
This GitHub project is a C implementation of the Greedy Graph Coloring Algorithm. The algorithm aims to color the vertices of an undirected graph in such a way that no two adjacent vertices share the same color, while minimizing the total number of colors used.
Add a description, image, and links to the coloring-graph topic page so that developers can more easily learn about it.
To associate your repository with the coloring-graph topic, visit your repo's landing page and select "manage topics."