6 citations · 9 across the 5 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.DS2018
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…
cs.DS2018
Spectrally Robust Graph Isomorphism
Alexandra Kolla, Ioannis Koutis, Vivek Madan +1
We initiate the study of spectral generalizations of the graph isomorphism problem. (a)The Spectral Graph Dominance (SGD) problem: On input of two graphs and does there exi…