让下一篇重要论文，不再错过。

原文摘要

An identification of two vertices \(u\) and \(v\) in a graph replaces them with a new vertex that is made adjacent to every vertex of \(N(u)\cup N(v)\setminus \{u,v\}\). We study the \(\mathcal{H}\)-Identification problem, which is to decide whether a given graph \(G\) can be transformed (``identified'') to a graph in \(\mathcal{H}\) by applying at most \(k\) vertex identifications. We determine the classical and parameterized complexity of this problem for various subclasses \(\mathcal{H}\) of chordal graphs, obtaining an almost complete picture for two parameters: \(k\) and \(n-k\). We also consider the Identification problem, which is to test, for two given graphs \(G\) and \(H\), whether \(G\) can be identified to \(H\). We determine the parameterized complexity of this problem when \(H\) is a graph from one of our testbed classes, taking the number of simplicial vertices of \(H\) as the parameter.