Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization

A matching cut is a partition of the vertex set of a graph into two sets A and B such that each vertex has at most one neighbor in the other side of the cut. The Matching Cut problem asks whether a graph has a matching cut, and has been intensively studied in the literature. Motivated by a question...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Algorithmica Ročník 83; číslo 6; s. 1677 - 1706
Hlavní autoři: Gomes, Guilherme C. M., Sau, Ignasi
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.06.2021
Springer Nature B.V
Springer Verlag
Témata:
Algorithm Analysis and Problem Complexity
Algorithms
Applications of mathematics
Clusters
Computer Science
Computer Systems Organization and Communication Networks
Data Structures and Information Theory
Graph matching
Graphs
Hardness
Integers
Kernels
Mathematical analysis
Mathematics
Mathematics of Computing
Partitions (mathematics)
Polynomials
Theory of Computation
Vertex sets
FPT algorithm
Matching cut
Distance to cluster
Bounded degree cut
Polynomial kernel
Parameterized complexity
bounded degree cut
parameterized complexity
polynomial kernel
matching cut
distance to cluster
ISSN:0178-4617, 1432-0541
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:A matching cut is a partition of the vertex set of a graph into two sets A and B such that each vertex has at most one neighbor in the other side of the cut. The Matching Cut problem asks whether a graph has a matching cut, and has been intensively studied in the literature. Motivated by a question posed by Komusiewicz et al. [Discrete Applied Mathematics, 2020], we introduce a natural generalization of this problem, which we call d -Cut : for a positive integer d , a d - cut is a bipartition of the vertex set of a graph into two sets A and B such that each vertex has at most d neighbors across the cut. We generalize (and in some cases, improve) a number of results for the Matching Cut problem. Namely, we begin with an NP-hardness reduction for d -Cut on ( 2 d + 2 ) -regular graphs and a polynomial algorithm for graphs of maximum degree at most d + 2 . The degree bound in the hardness result is unlikely to be improved, as it would disprove a long-standing conjecture in the context of internal partitions. We then give FPT algorithms for several parameters: the maximum number of edges crossing the cut, treewidth, distance to cluster, and distance to co-cluster. In particular, the treewidth algorithm improves upon the running time of the best known algorithm for Matching Cut . Our main technical contribution, building on the techniques of Komusiewicz et al. [DAM, 2020], is a polynomial kernel for d -Cut for every positive integer d , parameterized by the vertex deletion distance of the input graph to a cluster graph. We also rule out the existence of polynomial kernels when parameterizing simultaneously by the number of edges crossing the cut, the treewidth, and the maximum degree. Finally, we provide an exact exponential algorithm slightly faster than the naive brute force approach running in time O ∗ 2 n .
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0178-4617
1432-0541
DOI:10.1007/s00453-021-00798-8