Author:
Crescenzi Pierluigi,Marino Andrea
Publisher
Springer International Publishing
Reference31 articles.
1. Abboud A, Williams VV, Wang JR (2016) Approximation and fixed parameter subquadratic algorithms for radius and diameter in sparse graphs. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, 10–12 Jan 2016, pp 377–391
2. Akiba T, Iwata Y, Kawata Y (2015) An exact algorithm for diameters of large real directed graphs. In: Experimental Algorithms – 14th International Symposium, SEA 2015, Paris, 29 June–1 July 2015, Proceedings, pp 56–67
3. Backstrom L, Boldi P, Rosa M, Ugander J, Vigna S (2012) Four degrees of separation. In: Web Science 2012, WebSci’12, Evanston, 22–24 June 2012, pp 33–42
4. Boldi P, Vigna S (2003) The WebGraph framework I: compression techniques. In: Proceedings of the 13th International World Wide Web Conference. ACM Press, Manhattan, pp 595–601
5. Boldi P, Rosa M, Vigna S (2011) Hyperanf: approximating the neighbourhood function of very large graphs on a budget. In: Proceedings of the 20th International Conference on World Wide Web, WWW 2011, Hyderabad, 28 Mar–1 Apr 2011, pp 625–634