Autor:	Mhamdi Amel, Naanaa Wady
Rok vydání:	2014
Předmět:	Discrete mathematics Mathematical optimization Disjoint union Computer science Constraint programming Graph (abstract data type) Decision problem MathematicsofComputing_DISCRETEMATHEMATICS
Zdroj:	Advances in Intelligent Systems and Computing ISBN: 9783319075921 DCAI
DOI:	10.1007/978-3-319-07593-8_59
Popis:	Given a graph G = (S,E), the problem dealt with in this paper consists in partitioning S into a disjoint union of cliques by adding or removing a minimum number z(G) of edges. The problem, which is refered to by the Zahn Problem (ZP), is NP-hard in general.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::18ca29c36b4638e5b7febed028db110a https://doi.org/10.1007/978-3-319-07593-8_59 Zobrazit plný text záznamu