An On-line Competitive Algorithm for Coloring $$P_8$$-free Bipartite Graphs (Q2942656): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1502.00859 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative worst order ratio for online algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for On-line Coloring Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-Line Coloring of H-Free Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for On-line Graph Colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line 3-chromatic graphs. II: Critical 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: Q3496352 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-Line Coloring and Recursive Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-Line and First-fit Coloring of Graphs that Do Not Induce $P_5 $ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3950561 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An on-line graph coloring algorithm with sublinear performance ratio / rank
 
Normal rank

Latest revision as of 18:49, 10 July 2024

scientific article
Language Label Description Also known as
English
An On-line Competitive Algorithm for Coloring $$P_8$$-free Bipartite Graphs
scientific article

    Statements