Long paths in random Apollonian networks
Date of Original Version
This is an Accepted Manuscript of an article published by Taylor & Francis Group, available online at: http://www.tandfonline.com/10.1080/15427951.2014.925524.
Abstract or Description
We consider the length L(n) of the longest path in a randomly generated Apollonian Network (ApN) . We show that with high probability for any constant c < 2/3.
This document is currently not available here.
Internet Mathematics, 11, 4-5, 308-318.