A still better performance guarantee for approximate graph coloring-Reference-Cited by-同舟云学术

A still better performance guarantee for approximate graph coloring

Published:1993-01 Issue:1 Volume:45 Page:19-23
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Halldórsson Magnús M.

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference6 articles.

1. A better performance guarantee for approximate graph coloring;Berger;Algorithmica,1990

2. Approximating maximum independent sets by excluding subgraphs;Boppana;BIT,1992

3. Lower bounds for on-line graph coloring;Halldórsson;Proc. 3rd ACM-SIAM Symp. on Discrete Algorithms,1992

4. Worst case behaviour of graph coloring algorithms;Johnson;Proc. 5th Southeastern Conf. on Combinatorics, Graph Theory, and Computing, Congr. Numer.,1974

Cited by 129 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Online Graph Coloring with Predictions;Lecture Notes in Computer Science;2024

2. On the Finiteness of k-Vertex-Critical $$2P_2$$-Free Graphs with Forbidden Induced Squids or Bulls;Lecture Notes in Computer Science;2024

3. Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

4. Contemporary Methods for Graph Coloring as an Example of Discrete Optimization;International Journal of Electronics and Telecommunications;2023-07-26

5. Dominator Coloring of Total Graph of Path and Cycle;Mathematical Models in Engineering;2023-06-23