Online independent sets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1858, Issue , 2000, Pages 202-209

  Halldórsson, Magnús M ^a,b   Iwama, Kazuo ^a   Miyazaki, Shuichi ^a   Taketomi, Shiro ^a  

^a KYOTO UNIVERSITY   (Japan)

^b UNIVERSITY OF ICELAND   (Iceland)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS;

ALTERNATIVE SOLUTIONS; COMPETITIVE RATIO; INDEPENDENT SET; INDEPENDENT SET PROBLEMS; LOWER BOUNDS; ON-LINE ALGORITHMS; PERFORMANCE RATIO; POLYNOMIAL NUMBER;

POLYNOMIALS;

EID: 84957021949     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44968-x_20     Document Type: Conference Paper

References (8)

1. D. Bean, "Effective coloration," J. Symbolic Logic, Vol. 41, pp. 469-480, 1976.
2. A. Gyárfás and J. Lehel, "On-line and first fit colorings of graphs," J. Graph Theory, Vol. 12(2), pp. 217-227, 1988.
3. M. Halldórsson "Online coloring known graphs," Electronic J. Combinatorics, Vol. 7, R6, 2000. www.combinatorics.org.
4. M. Halldórsson and M. Szegedy, "Lower bounds for on-line graph coloring," Theoretical Computer Science, Vol. 130, pp. 163-174, 1994.
5. H. Kierstead, "On-line coloring k-colorable graphs," Israel J. of Math, Vol. 105, pp. 93-104, 1998.
6. H. A. Kierstead and W. T. Trotter, "An extremal problem in recursive combinatorics," Congressus Numerantium Vol. 33, pp. 143-153, 1981.
7. R. J. Lipton and A. Tomkins, "Online interval scheduling," Proc. SODA '94, pp. 302-311, 1994.
8. L. Lovász, M. Saks, and W. T. Trotter, "An online graph coloring algorithm with sublinear performance ratio," Discrete Math., Vol. 75, pp. 319-325, 1989.