Sign in
Optimizing Graph Partition by Optimal Vertex-Cut: A Holistic Approach.
Wenwen Qu
Weixi Zhang
Ji Cheng
Chaorui Zhang
Wei Han
Bo Bai
Chen Jason Zhang
Liang He
Xiaoling Wang
Published in:
ICDE (2023)
Keyphrases
</>
vertex set
undirected graph
directed graph
normalized cut
min cut
weighted graph
labeled graphs
dynamic programming
finding optimal
random walk
minimum cost
graph structure
random graphs
structured data
optimal solution
worst case
hamiltonian cycle
graph representation
bipartite graph
minimum weight
planar graphs