Mina Dalirrooyfard

activity

20232026

most citedGraph Partitioning With Limited Moves

1 citations · 1 across the 8 of their papers we have counts for

collaborators

Showing 2024Show all

3 papers · 1 filter

cs.DS2024

Differentially Private Gomory-Hu Trees

Anders Aamand, Justin Y. Chen, Mina Dalirrooyfard +4

Given an undirected, weighted $n$ -vertex graph $G = (V, E, w)$ , a Gomory-Hu tree $T$ is a weighted tree on $V$ such that for any pair of distinct vertices $s, t \in V$ , the Min- $s$ …

cs.DS2024★ 1 cited

Graph Partitioning With Limited Moves

Majid Behbahani, Mina Dalirrooyfard, Elaheh Fata +1

In many real world networks, there already exists a (not necessarily optimal) $k$ -partitioning of the network. Oftentimes, one aims to find a $k$ -partitioning with a smaller cut va…

cs.DS2024

Pruned Pivot: Correlation Clustering Algorithm for Dynamic, Parallel, and Local Computation Models

Mina Dalirrooyfard, Konstantin Makarychev, Slobodan Mitrović

Given a graph with positive and negative edge labels, the correlation clustering problem aims to cluster the nodes so to minimize the total number of between-cluster positive and w…