Huynh, The Dang; Mathieu, Fabien; Viennot, Laurent LiveRank: how to refresh old datasets. (English) Zbl 1461.68028 Internet Math. 12, No. 1-2, 68-84 (2016). MSC: 68M11 05C82 05C85 91D30 PDFBibTeX XMLCite \textit{T. D. Huynh} et al., Internet Math. 12, No. 1--2, 68--84 (2016; Zbl 1461.68028) Full Text: DOI
Slota, George M.; Madduri, Kamesh; Rajamanickam, Sivasankaran Complex network partitioning using label propagation. (English) Zbl 1386.68214 SIAM J. Sci. Comput. 38, No. 5, S620-S645 (2016). MSC: 68W10 05C70 05C82 05C85 68R10 PDFBibTeX XMLCite \textit{G. M. Slota} et al., SIAM J. Sci. Comput. 38, No. 5, S620--S645 (2016; Zbl 1386.68214) Full Text: DOI
Brandes, Ulrik; Hamann, Michael; Strasser, Ben; Wagner, Dorothea Fast quasi-threshold editing. (English) Zbl 1465.68209 Bansal, Nikhil (ed.) et al., Algorithms – ESA 2015. 23rd annual European symposium, Patras, Greece, September 14–16, 2015. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 9294, 251-262 (2015). MSC: 68R10 68W05 PDFBibTeX XMLCite \textit{U. Brandes} et al., Lect. Notes Comput. Sci. 9294, 251--262 (2015; Zbl 1465.68209) Full Text: DOI arXiv
Rossi, Ryan A.; Gleich, David F.; Gebremedhin, Assefaw H. Parallel maximum clique algorithms with applications to network analysis. (English) Zbl 1323.05103 SIAM J. Sci. Comput. 37, No. 5, C589-C616 (2015). MSC: 05C69 05C82 05C85 05C90 90C27 PDFBibTeX XMLCite \textit{R. A. Rossi} et al., SIAM J. Sci. Comput. 37, No. 5, C589--C616 (2015; Zbl 1323.05103) Full Text: DOI
Kolda, Tamara G.; Pinar, Ali; Plantenga, Todd; Seshadhri, C.; Task, Christine Counting triangles in massive graphs with MapReduce. (English) Zbl 1306.05237 SIAM J. Sci. Comput. 36, No. 5, S48-S77 (2014). MSC: 05C85 62H12 65Y10 68W15 68W20 PDFBibTeX XMLCite \textit{T. G. Kolda} et al., SIAM J. Sci. Comput. 36, No. 5, S48--S77 (2014; Zbl 1306.05237) Full Text: DOI arXiv
Crescenzi, Pilu; Grossi, Roberto; Habib, Michel; Lanzi, Leonardo; Marino, Andrea On computing the diameter of real-world undirected graphs. (English) Zbl 1278.68230 Theor. Comput. Sci. 514, 84-95 (2013). MSC: 68R10 05C85 68M10 05C12 PDFBibTeX XMLCite \textit{P. Crescenzi} et al., Theor. Comput. Sci. 514, 84--95 (2013; Zbl 1278.68230) Full Text: DOI
Ferragina, Paolo; Nitto, Igor; Venturini, Rossano On the bit-complexity of Lempel-Ziv compression. (English) Zbl 1276.68069 SIAM J. Comput. 42, No. 4, 1521-1541 (2013). MSC: 68P30 68R10 68Q25 68P05 90C39 PDFBibTeX XMLCite \textit{P. Ferragina} et al., SIAM J. Comput. 42, No. 4, 1521--1541 (2013; Zbl 1276.68069) Full Text: DOI arXiv Link
Çatalyürek, Ümit V.; Kaya, Kamer; Langguth, Johannes; Uçar, Bora A partitioning-based divisive clustering technique for maximizing the modularity. (English) Zbl 1280.05127 Bader, David A. (ed.) et al., Graph partitioning and graph clustering. Proceedings of the 10th DIMACS implementation challenge workshop, Atlanta, GA, USA, February 13–14, 2012. Providence, RI: American Mathematical Society (AMS) (ISBN 978-0-8218-9038-7/pbk; 978-0-8218-9869-7/ebook). Contemporary Mathematics 588, 171-186 (2013). MSC: 05C85 05C70 PDFBibTeX XMLCite \textit{Ü. V. Çatalyürek} et al., Contemp. Math. 588, 171--186 (2013; Zbl 1280.05127)
Laura, Luigi; Santaroni, Federico Computing strongly connected components in the streaming model. (English) Zbl 1325.05171 Marchetti-Spaccamela, Alberto (ed.) et al., Theory and practice of algorithms in (computer) systems. First international ICST conference, TAPAS 2011, Rome, Italy, April 18–20, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-19753-6/pbk). Lecture Notes in Computer Science 6595, 193-205 (2011). MSC: 05C85 05C40 68Q10 PDFBibTeX XMLCite \textit{L. Laura} and \textit{F. Santaroni}, Lect. Notes Comput. Sci. 6595, 193--205 (2011; Zbl 1325.05171) Full Text: DOI
Karande, Chinmay; Chellapilla, Kumar; Andersen, Reid Speeding up algorithms on compressed web graphs. (English) Zbl 1235.68037 Internet Math. 6, No. 3, 373-398 (2009). MSC: 68M11 68P30 68R10 05C85 PDFBibTeX XMLCite \textit{C. Karande} et al., Internet Math. 6, No. 3, 373--398 (2009; Zbl 1235.68037) Full Text: DOI Euclid
Latapy, Matthieu Main-memory triangle computations for very large (sparse (power-law)) graphs. (English) Zbl 1152.68045 Theor. Comput. Sci. 407, No. 1-3, 458-473 (2008). MSC: 68R10 05C85 68W05 PDFBibTeX XMLCite \textit{M. Latapy}, Theor. Comput. Sci. 407, No. 1--3, 458--473 (2008; Zbl 1152.68045) Full Text: DOI