Treffer: A tight bound for online colouring of disk graphs
Title:
A tight bound for online colouring of disk graphs
Source:
Structural information and communication complexity (SIROCCO 2005)Theoretical computer science. 384(2-3):152-160
Publisher Information:
Amsterdam: Elsevier, 2007.
Publication Year:
2007
Physical Description:
print, 18 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Combinatoire. Structures ordonnées, Combinatorics. Ordered structures, Combinatoire, Combinatorics, Théorie des graphes, Graph theory, 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, Recherche information. Graphe, Information retrieval. Graph, Divers, Miscellaneous, Algorithme déterministe, Deterministic algorithms, Algorithme en ligne, Online algorithm, Algoritmo en línea, Borne inférieure, Lower bound, Cota inferior, Borne supérieure, Upper bound, Cota superior, Chevauchement, Overlap, Imbricación, Coloration graphe, Graph colouring, Coloración grafo, Compétitivité, Competitiveness, Competitividad, Disque, Disk, Disco, Entrée ordinateur, Input, Entrada ordenador, Informatique théorique, Computer theory, Informática teórica, Plan, Plane, Plano, Unité, Unit, Unidad, 05C15, 68R10, 68Wxx, Algorithm en ligne, Graphe coloré, Disk graphs, Online algorithms
Document Type:
Konferenz
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Research Academic Computer Technology Institute and Department of Computer Engineering and Informatics, University of Patras, 26500 Rio, Greece
Max Plank Institut für Informatik, Im Stadtwald, Geb. 46.1, 66123 Saarbrücken, Germany
Max Plank Institut für Informatik, Im Stadtwald, Geb. 46.1, 66123 Saarbrücken, Germany
ISSN:
0304-3975
Rights:
Copyright 2008 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
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
Mathematics
Mathematics
Accession Number:
edscal.19109040
Database:
PASCAL Archive
Weitere Informationen
We present an improved upper bound on the competitiveness of the online colouring algorithm First-Fit in disk graphs, which are graphs representing overlaps of disks on the plane. We also show that this bound is best possible for deterministic online colouring algorithms that do not use the disk representation of the input graph. We also present a related new lower bound for unit disk graphs.