42 citations · 197 across the 45 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2019★ 4 cited
Seedless Graph Matching via Tail of Degree Distribution for Correlated Erdos-Renyi Graphs
Mahdi Bozorg, Saber Salehkaleybar, Matin Hashemi
The network alignment (or graph matching) problem refers to recovering the node-to-node correspondence between two correlated networks. In this paper, we propose a network alignmen…
cs.DS2018★ 10 cited
Counting and Sampling from Markov Equivalent DAGs Using Clique Trees
AmirEmad Ghassami, Saber Salehkaleybar, Negar Kiyavash +1
A directed acyclic graph (DAG) is the most common graphical model for representing causal relationships among a set of variables. When restricted to using only observational data,…