Author:
Mann Zoltán Ádám,Szajkó Anikó
Funder
Hungarian National Research Fund
National Office for Research and Technology
János Bolyai Research Scholarship of the Hungarian Academy of Sciences
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference48 articles.
1. Improvements to graph coloring register allocation;Briggs;ACM Transactions on Programming Languages and Systems,1994
2. The application of a graph coloring method to an examination scheduling problem;Mehta;Interfaces,1981
3. Optimization problems in system-level synthesis;Mann,2003
4. On the evolution of random graphs;Erdős;A Magyar Tudományos Akadémia Matematikai Kutató Intézetének Közleményei,1960
5. Random Graphs;Bollobás,2001
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Comparative Analysis of the main Graph Coloring Algorithms;2021 IEEE Colombian Conference on Communications and Computing (COLCOM);2021-05-26
2. Complexity of Coloring Random Graphs;ACM Journal of Experimental Algorithmics;2018-11-15
3. Uncertain vertex coloring problem;Soft Computing;2017-10-20