Dichotomy of the H-Quasi-Cover Problem

DOI10.1007/978-3-642-38536-0_27zbMath1381.68097OpenAlexW2249342429MaRDI QIDQ4928495

Jiří Fiala, Marek Tesař

Publication date: 14 June 2013

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38536-0_27

zbMATH Keywords

computational complexitydichotomygraph cover

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

An algorithmic framework for locally constrained homomorphisms

This page was built for publication: Dichotomy of the H-Quasi-Cover Problem