Online \(L(2,1)\)-coloring problem on paths with restricted size of memory

DOI10.1134/s1995080223020117OpenAlexW4377230570MaRDI QIDQ6043925

D. Bashirova

Publication date: 25 May 2023

Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1995080223020117

zbMATH Keywords

online algorithmlimited memoryonline coloring\(L(2, 1)\)-coloring problem

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• A fast work function algorithm for solving the \(k\)-server problem
• Quantum online algorithms with respect to space and advice complexity
• On the advice complexity of the online \(L(2,1)\)-coloring problem on paths and cycles
• Competitive snoopy caching
• Design and analysis of randomized algorithms. Introduction to design paradigms.
• A survey on labeling graphs with a condition at distance two
• Advice Complexity of Online Coloring for Paths
• Competitive Analysis of Aggregate Max in Windowed Streaming
• Labelling Graphs with a Condition at Distance 2
• Approximations for  -Colorings of Graphs
• Advice Complexity of the Online Coloring Problem
• Some optimal inapproximability results
• Combinatorial Geometry and Graph Theory

This page was built for publication: Online \(L(2,1)\)-coloring problem on paths with restricted size of memory