A tight bound for online colouring of disk graphs (Q2382668): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2007.04.025 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2136536722 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence and Coloring Problems on Intersection Graphs of Disks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On distance constrained labeling of disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On coloring unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line and first fit colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representing graphs by disks and balls (a survey of recognition-complexity results) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring inductive graphs on-line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple heuristics for unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The on-line first-fit algorithm for radio frequency assignment problems. / rank
 
Normal rank

Latest revision as of 10:24, 27 June 2024

scientific article
Language Label Description Also known as
English
A tight bound for online colouring of disk graphs
scientific article

    Statements

    A tight bound for online colouring of disk graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 October 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    Graph colouring
    0 references
    online algorithms
    0 references
    disk graphs
    0 references
    0 references