Please note: Linked content is NOT stored on Carnegie Mellon University and we can't guarantee its availability, quality, security or accept any liability.
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.
History
Publisher Statement
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.