KFUPM ePrints
metadata only
A Study of Graph Coloring Heuristics And its Application to a Time Tabling Problem In a Registration and Scheduling System
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Partitioning based algorithms for some colouring problems#823225
- Gedanken: A tool for Pondering the Tractability of Correct Program Technology#1134029
- Assessment of a heuristic algorithm for scheduling Theater Security Cooperation naval missions#633678
- Algorithmic Simulation for Optimization in Combinatorial Mathematics Using Heuristic Techniques#250532
- A new heuristic algorithm for resource-constrained operating room scheduling problem: A case study#145023
Record · ID 298652
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive