Yazdanparast, Sakineh; Havens, Timothy C. Modularity maximization using completely positive programming. (English) Zbl 1400.91499 Physica A 471, 20-32 (2017). MSC: 91D30 68M10 90C35 90C05 PDFBibTeX XMLCite \textit{S. Yazdanparast} and \textit{T. C. Havens}, Physica A 471, 20--32 (2017; Zbl 1400.91499) Full Text: DOI
Wang, Xiao; Cao, Xiaochun; Jin, Di; Cao, Yixin; He, Dongxiao The (un)supervised NMF methods for discovering overlapping communities as well as hubs and outliers in networks. (English) Zbl 1400.91495 Physica A 446, 22-34 (2016). MSC: 91D30 05C82 68M10 62F15 62H12 65Y20 PDFBibTeX XMLCite \textit{X. Wang} et al., Physica A 446, 22--34 (2016; Zbl 1400.91495) Full Text: DOI
Comellas, Francesc; Miralles, Alicia A fast and efficient algorithm to identify clusters in networks. (English) Zbl 1207.68033 Appl. Math. Comput. 217, No. 5, 2007-2014 (2010). MSC: 68M10 68T10 PDFBibTeX XMLCite \textit{F. Comellas} and \textit{A. Miralles}, Appl. Math. Comput. 217, No. 5, 2007--2014 (2010; Zbl 1207.68033) Full Text: DOI Link
Hyvönen, Jörkki; Saramäki, Jari; Kaski, Kimmo Efficient data structures for sparse network representation. (English) Zbl 1154.68369 Int. J. Comput. Math. 85, No. 8, 1219-1233 (2008). MSC: 68P05 68M10 PDFBibTeX XMLCite \textit{J. Hyvönen} et al., Int. J. Comput. Math. 85, No. 8, 1219--1233 (2008; Zbl 1154.68369) Full Text: DOI
Laing, A. K.; Cypher, R.; Duncan, C. A. On the flattest common supersequence method for deadlock-free routing in arbitrary networks. (English) Zbl 0969.68009 Theory Comput. Syst. 33, No. 5-6, 393-426 (2000). MSC: 68M10 PDFBibTeX XMLCite \textit{A. K. Laing} et al., Theory Comput. Syst. 33, No. 5--6, 393--426 (2000; Zbl 0969.68009) Full Text: DOI