Geek asks and answers

Calculation of the degeneracy of a graph?

I am looking for a way to calculate the degeneracy of a given graph. The wikipedia article describes the method, but it also stores the degeneracy order, and I think I saw a simpler algorithm somewhere online weeks ago, but I can. Don't find it now. I am wondering if there is a more efficient way to calculate graph degeneracy if I am not interested in maintaining the order of graph degeneracy

I use networkx and Python, if that matters at all.

Thank!

+3
source share
1 answer

NetworkX has the basic algorithm of Batagelj and Zaversnik O (m), which, I think, you can use for your purpose degeneracy(G) = max(networkx.core_number(G).values()):? http://networkx.lanl.gov/reference/algorithms.core.html

+1
source

More articles:


All Articles