On Minimum Maximal Distance-k Matchings
From MaRDI portal
Publication:4560225
zbMath1401.68252arXiv1602.04581MaRDI QIDQ4560225
Andrew Ryzhikov, Yury Kartynnik
Publication date: 10 December 2018
Full work available at URL: https://arxiv.org/abs/1602.04581
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) 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) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items