scientific article; zbMATH DE number 6257561

zbMath1282.68197MaRDI QIDQ5747397

Dariusz Dereniowski, Piotr Borowiecki

Publication date: 14 February 2014

Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/1316/0.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

greedy algorithmsplit graphgraph coloringon-line algorithmadvice complexitygraph rankingsemi on-line algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Online algorithms; streaming algorithms (68W27)

Related Items (1)

The complexity of bicriteria tree-depth

This page was built for publication: