1 citations · 1 across the 2 of their papers we have counts for
4 papers
Equitable Partitions into Matchings and Coverings in Mixed Graphs
Tamás Király, Yu Yokoi
Matchings and coverings are central topics in graph theory. The close relationship between these two has been key to many fundamental algorithmic and polyhedral results. For mixed…
Improving the Integrality Gap for Multiway Cut
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király +1
In the multiway cut problem, we are given an undirected graph with non-negative edge weights and a collection of terminal nodes, and the goal is to partition the node set of th…
Global and fixed-terminal cuts in digraphs
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király +2
The computational complexity of multicut-like problems may vary significantly depending on whether the terminals are fixed or not. In this work we present a comprehensive study of…
Blocking optimal -arborescences
Attila Bernáth, Tamás Király
Given a digraph and a positive integer , an arc set is called a \textbf{-arborescence} if it is the disjoint union of spanning arborescences. The…