Coloring inductive graphs on-line
From MaRDI portal
Publication:1312187
DOI10.1007/BF01294263zbMath0784.68067OpenAlexW2057674319WikidataQ57259022 ScholiaQ57259022MaRDI QIDQ1312187
Publication date: 27 March 1994
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01294263
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items (22)
Online makespan minimization with parallel schedules ⋮ On the performance of the first-fit coloring algorithm on permutation graphs ⋮ A tight bound for online colouring of disk graphs ⋮ A note on algebraic expressions of rhomboidal labeled graphs ⋮ First-fit colorings of graphs with no cycles of a prescribed even length ⋮ Online promise problems with online width metrics ⋮ On the complexity of injective colorings and its generalizations ⋮ Colouring bottomless rectangles and arborescences ⋮ First-fit chromatic numbers of \(d\)-degenerate graphs ⋮ Non-clairvoyant scheduling with conflicts for unit-size jobs ⋮ Tight bounds for online coloring of basic graph classes ⋮ A note on the online first-fit algorithm for coloring \(k\)-inductive graphs ⋮ Online Conflict-Free Colouring for Hypergraphs ⋮ R.e. Prime powers and total rigidity ⋮ An approximation scheme for bin packing with conflicts ⋮ Tight Bounds for Online Coloring of Basic Graph Classes ⋮ Unnamed Item ⋮ Effective Wireless Scheduling via Hypergraph Sketches ⋮ Delayed information and action in on-line algorithms ⋮ On-line coloring of geometric intersection graphs ⋮ Efficacy of line-based explicit and compact high-order finite difference schemes for hybrid unstructured grids ⋮ Decomposition methods for generating algebraic expressions of full square rhomboids and other graphs
Cites Work
This page was built for publication: Coloring inductive graphs on-line
