Optimal hierarchical clustering on a graph
Sign Up to like & getrecommendations! Published in 2022 at "Networks"
DOI: 10.1002/net.22043
Abstract: Given an undirected graph with positive weights on the edges we study a parametric biobjective graph clustering problem. We remove a subset of edges to break the graph into smaller pieces, that is, connected components,… read more here.
Keywords: optimal hierarchical; clustering graph; hierarchical clustering; graph ... See more keywords