Online Coloring of Intervals with Bandwidth
暂无分享,去创建一个
[1] Hal A. Kierstead,et al. Coloring Graphs On-line , 1996, Online Algorithms.
[2] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .
[3] P. Hell,et al. Graph Problems Arising from Wavelength-Routing in All-Optical Networks , 2004 .
[4] Hal A. Kierstead,et al. On-Line and First-Fit Coloring of Graphs That Do Not Induce P5 , 1995, SIAM J. Discret. Math..
[5] Hans S. Witsenhausen. On Woodall's Interval Problem , 1976, J. Comb. Theory, Ser. A.
[6] Jun Qin,et al. Coloring interval graphs with first-fit , 1995, Discret. Math..
[7] Stefano Leonardi,et al. On-Line Routing in All-Optical Networks , 1997, Theor. Comput. Sci..
[8] András Gyárfás,et al. On-line and first fit colorings of graphs , 1988, J. Graph Theory.
[9] Marek Chrobak,et al. On Some Packing Problem Related to Dynamic Storage Allocation , 1988, RAIRO Theor. Informatics Appl..
[10] H. A. Kierstead,et al. The Linearity of First-Fit Coloring of Interval Graphs , 1988, SIAM J. Discret. Math..
[11] Anja Feldmann,et al. On-line Call Admission for High-Speed Networks , 1995 .
[12] Klaus Jansen,et al. Off-Line and On-Line Call-Scheduling in Stars and Trees , 1997, WG.
[13] Heinrich Müller,et al. Effiziente Methoden der geometrischen Modellierung und der wissenschaftlichen Visualisierung, Dagstuhl Seminar 1997 , 1999, Effiziente Methoden der geometrischen Modellierung und der wissenschaftlichen Visualisierung.