Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Bengali, Vedangi"'
Autor:
Bengali, Vedangi, Veldt, Nate
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 hypergraph cut function assigns a cut penalty to each hyperedge based on the num
Externí odkaz:
http://arxiv.org/abs/2409.16195
Autor:
Bengali, Vedangi, Veldt, Nate
Graph clustering is a fundamental task in network analysis where the goal is to detect sets of nodes that are well-connected to each other but sparsely connected to the rest of the graph. We present faster approximation algorithms for an NP-hard para
Externí odkaz:
http://arxiv.org/abs/2306.04884