92 citations · 156 across the 18 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.DC2016★ 6 cited
Deterministic MST Sparsification in the Congested Clique
Janne H. Korhonen
We give a simple deterministic constant-round algorithm in the congested clique model for reducing the number of edges in a graph to while preserving the minimu…
cs.AI2016
Bayesian Network Structure Learning with Integer Programming: Polytopes, Facets, and Complexity
James Cussens, Matti Järvisalo, Janne H. Korhonen +1
The challenging task of learning structures of probabilistic graphical models is an important problem within modern AI research. Recent years have witnessed several major algorithm…