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!

Buďte první, kdo okomentuje tento záznam!