The graph tessellation cover number: extremal bounds, efficient algorithms and hardness
From MaRDI portal
Publication:2294676
DOI10.1007/978-3-319-77404-6_1zbMath1442.05169arXiv1712.07476OpenAlexW2963120282MaRDI QIDQ2294676
Publication date: 12 February 2020
Full work available at URL: https://arxiv.org/abs/1712.07476
Quantum computation (81P68) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (3)
The role of tessellation intersection in staggered quantum walks ⋮ A computational complexity comparative study of graph tessellation problems ⋮ The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness
This page was built for publication: The graph tessellation cover number: extremal bounds, efficient algorithms and hardness
