Treffer: On-line coloring of H-free bipartite graphs

Title:
On-line coloring of H-free bipartite graphs
Authors:
BROERSMA, H. J, CAPPONI, A, PAULUSMA, D
Source:
Algorithms and complexity (6th Italian conference, CIAC 2006, Rome, Italy, May 29-31, 2006)0CIAC 2006. :284-295
Publisher Information:
Berlin: Springer, 2006.
Publication Year:
2006
Physical Description:
print, 16 ref 1
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Algorithme compétitif, Competitive algorithms, Borne supérieure, Upper bound, Cota superior, Coloration graphe, Graph colouring, Coloración grafo, Complexité calcul, Computational complexity, Complejidad computación, Graphe biparti, Bipartite graph, Grafo bipartido, Graphe chromatique, Chromatic graph, Grafo cromático, Nombre chromatique, Chromatic number, Número cromático
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Department of Computer Science, Durham University, Science Labs, South Road, Durham DH1 3LE, United Kingdom
Computer Science, Division of Engineering and Applied Sciences, California Institute of Technology, United States
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=19150318
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.19150318
Database:
PASCAL Archive

Weitere Informationen

We present a new on-line algorithm for coloring bipartite graphs. This yields a new upper bound on the on-line chromatic number of bipartite graphs, improving a bound due to Lovász, Saks and Trotter. The algorithm is on-line competitive on various classes of H-free bipartite graphs, in particular P6-free bipartite graphs and P7-free bipartite graphs, i.e., that do not contain an induced path on six, respectively seven vertices. The number of colors used by the on-line algorithm in these particular cases is bounded by roughly twice, respectively roughly eight times the on-line chromatic number. In contrast, it is known that there exists no competitive on-line algorithm to color P6-free (or P7-free) bipartite graphs, i.e., for which the number of colors is bounded by any function only depending on the chromatic number.