2 papers
cs.CC2024
On the Complexity of Establishing Hereditary Graph Properties via Vertex Splitting
Alexander Firbas, Manuel Sorge
Vertex splitting is a graph operation that replaces a vertex with two nonadjacent new vertices and makes each neighbor of adjacent with one or both of the introduced vertic…
cs.DS2023
The Complexity of Cluster Vertex Splitting and Company
Alexander Firbas, Alexander Dobler, Fabian Holzer +4
Clustering a graph when the clusters can overlap can be seen from three different angles: We may look for cliques that cover the edges of the graph with bounded overlap, we may loo…