most citedAlgorithm and Complexity for a Network Assortativity Measure

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

collaborators

1 paper

math.CO2013★ 1 cited

Algorithm and Complexity for a Network Assortativity Measure

Sarah J. Kunkler, M. Drew LaMar, Rex K. Kincaid +1

We show that finding a graph realization with the minimum Randić index for a given degree sequence is solvable in polynomial time by formulating the problem as a minimum weight per…