51 citations · 51 across the 1 of their papers we have counts for
2 papers
cond-mat.stat-mech2008★ 51 cited
Statistical Mechanics of Steiner trees
M. Bayati, C. Borgs, A. Braunstein +3
The Minimum Weight Steiner Tree (MST) is an important combinatorial optimization problem over networks that has applications in a wide range of fields. Here we discuss a general te…
cond-mat.dis-nn2003
Polynomial iterative algorithms for coloring and analyzing random graphs
A. Braunstein, R. Mulet, A. Pagnani +2
We study the graph coloring problem over random graphs of finite average connectivity . Given a number of available colors, we find that graphs with low connectivity admit a…