Covering graphs with convex sets and partitioning graphs into convex sets

DOI10.1016/j.ipl.2020.105944zbMath1432.68180arXiv1907.01581MaRDI QIDQ2308465

Luciano N. Grippo, Martín D. Safe, Vinícius Fernandes dos Santos, Lucía M. González

Publication date: 3 April 2020

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.01581

zbMATH Keywords

computational complexity; convex \(p\)-cover; convex \(p\)-partition

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)