Subject
Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software
Reference14 articles.
1. I.M. Bomze, M. Budinich, P.M. Pardalos, M. Pelillo, The maximum clique problem, in: D.-Z. Du, P.M. Pardalos (Eds.), Handbook of Combinatorial Optimization, Vol. 4, Kluwer Academic Publishers, Boston, MA, 1999, pp. 1–74.
2. J.M. Byskov, Chromatic number in time O(2.4023n) using maximal independent sets, Research Series RS-02-45, BRICS, Department of Computer Science, University of Aarhus, December 2002; URL http://www.brics.dk/RS/02/45/.
3. J.M. Byskov, Algorithms for k-colouring and finding maximal independent sets, in: Proceedings of the 14th Symposium on Discrete Algorithms, SIAM, 2003, pp. 456–457.
4. An algorithm for the chromatic number of a graph;Christofides;Comput. J.,1971
5. C. Croitoru, On stables in graphs, in: Proceedings of the Third Colloqium on Operations Research (Cluj-Napoca, 1978), University “Babeş-Bolyai”, Cluj-Napoca, 1979, pp. 55–60.
Cited by
84 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. BBQ-mIS: A Parallel Quantum Algorithm for Graph Coloring Problems;2023 IEEE International Conference on Quantum Computing and Engineering (QCE);2023-09-17
2. Algorithmic Applications of Hypergraph and Partition Containers;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
3. A Non-aligning Variant of Generalized Turán Problems;Annals of Combinatorics;2023-02-25
4. Exact algorithms for counting 3-colorings of graphs;Discrete Applied Mathematics;2022-12
5. Faster Graph Coloring in Polynomial Space;Algorithmica;2022-10-11