14 citations · 43 across the 5 of their papers we have counts for
Showing cs.SIShow all
2 papers · 1 filter
cs.SI2014
Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions
Ahmet Erdem Sariyuce, C. Seshadhri, Ali Pinar +1
Finding dense substructures in a graph is a fundamental graph mining operation, with applications in bioinformatics, social networks, and visualization to name a few. Yet most stan…
cs.SI2012★ 5 cited
Are we there yet? When to stop a Markov chain while generating random graphs
Jaideep Ray, Ali Pinar, C. Seshadhri
Markov chains are a convenient means of generating realizations of networks, since they require little more than a procedure for rewiring edges. If a rewiring procedure exists for…