Making octants colorful and related covering decomposition problems

DOI10.1137/1.9781611973402.105MaRDI QIDQ5384067zbMATH OpenOpenAlexFDO

Authors Jean Cardinal, Kolja Knauer, Piotr Micek, Torsten Ueckerdt

Publication date 20 June 2019

Published in Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611973402.105

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Online algorithms; streaming algorithms (68W27)

Recommendations

• Making Octants Colorful and Related Covering Decomposition Problems
• More on decomposing coverings by octants
• Octants are cover-decomposable into many coverings
• Octants are cover decomposable
• Octants are cover-decomposable

Cited in

(7)

• Octants are cover-decomposable into many coverings
• Octants are cover decomposable
• More on decomposing coverings by octants
• Octants are cover-decomposable
• Computing and Combinatorics
• Making Octants Colorful and Related Covering Decomposition Problems
• Coloring octrees

This page was built for publication: Making octants colorful and related covering decomposition problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5384067)