59 citations · 241 across the 37 of their papers we have counts for
3 papers · 1 filter
A Highly Scalable Labelling Approach for Exact Distance Queries in Complex Networks
Muhammad Farhan, Qing Wang, Yu Lin +1
Answering exact shortest path distance queries is a fundamental task in graph theory. Despite a tremendous amount of research on the subject, there is still no satisfactory solutio…
Addressing Johnson graphs, complete multipartite graphs, odd cycles and other graphs
Noga Alon, Sebastian M. Cioabă, Brandon D. Gilbert +2
Graham and Pollak showed that the vertices of any graph can be addressed with -tuples of three symbols, such that the distance between any two vertices may be easily determi…
Subgraph counts for dense random graphs with specified degrees
Catherine Greenhill, Mikhail Isaev, Brendan D. McKay
We prove two estimates for the expectation of the exponential of a complex function of a random permutation or subset. Using this theory, we find asymptotic expressions for the exp…