On the tractability and approximability of non-submodular cardinality-based - cut problems in hypergraphs
A minimum $ s $-$ t $ cut in a hypergraph is a bipartition of vertices that separates two
nodes $ s $ and $ t $ while minimizing a hypergraph cut function. The cardinality-based …
nodes $ s $ and $ t $ while minimizing a hypergraph cut function. The cardinality-based …
Revisiting Link Prediction with the Dowker Complex
We propose a novel method to study properties of graph-structured data by means of a
geometric construction called Dowker complex. We study this simplicial complex through the …
geometric construction called Dowker complex. We study this simplicial complex through the …