4 citations · 5 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2013★ 4 cited
Dynamic Gomory-Hu Tree Construction -- fast and simple
Tanja Hartmann, Dorothea Wagner
A cut tree (or Gomory-Hu tree) of an undirected weighted graph G=(V,E) encodes a minimum s-t-cut for each vertex pair {s,t} \subseteq V and can be iteratively constructed by n-1 ma…
cs.DS2013
Hierarchies of Predominantly Connected Communities
Michael Hamann, Tanja Hartmann, Dorothea Wagner
We consider communities whose vertices are predominantly connected, i.e., the vertices in each community are stronger connected to other community members of the same community tha…