 |
|
Broersma, H.J. and Capponi, A. and Paulusma, D.
(2008)
A new algorithm for on-line coloring bipartite graphs.
SIAM Journal on Discrete Mathematics, 22 (1).
.
ISSN 0895-4801
*** ISI Impact 0,668 ***
Full text available as: Official URL: http://dx.doi.org/10.1137/060668675  AbstractWe first show that for any bipartite graph  with at most five vertices there exists an on-line competitive algorithm for the class of -free bipartite graphs. We then analyze the performance of an on-line algorithm for coloring bipartite graphs on various subfamilies. The algorithm yields new upper bounds for the on-line chromatic number of bipartite graphs. We prove that the algorithm is on-line competitive for  -free bipartite graphs, i.e., that do not contain an induced path on seven vertices. The number of colors used by the on-line algorithm for  -free and -free bipartite graphs is, respectively, bounded by roughly twice and roughly eight times the on-line chromatic number. In contrast, it is known that there exists no competitive on-line algorithm to color -free (or -free) bipartite graphs, i.e., for which the number of colors is bounded by any function depending only on the chromatic number.
| Item Type: | Article |
|---|
| Research Group: | EWI-DMMP: Discrete Mathematics and Mathematical Programming |
|---|
| Research Program: | CTIT-IE&ICT: Industrial Engineering and ICT |
|---|
| ID Code: | 14147 |
|---|
| Status: | Published |
|---|
| Deposited On: | 15 December 2008 |
|---|
| Refereed: | Yes |
|---|
| International: | Yes |
|---|
| ISI Impact Factor: | 0,668 |
|---|
| More Information: | statisticsmetis |
|---|
Export this item as: To request a copy of the PDF please email us request copy To correct this item please ask your editor Repository Staff Only: edit this item
|
|
|
Nederlands
Contact
Sitemap
Search
Organisation