Luo, Junjie; Molter, Hendrik; Suchý, Ondřej A parameterized complexity view on collapsing \(k\)-cores. (English) Zbl 07449502 Theory Comput. Syst. 65, No. 8, 1243-1282 (2021). MSC: 68R10 05C85 68Qxx 91D30 PDF BibTeX XML Cite \textit{J. Luo} et al., Theory Comput. Syst. 65, No. 8, 1243--1282 (2021; Zbl 07449502) Full Text: DOI OpenURL
Li, Ming; Liu, Run-Ran; Lü, Linyuan; Hu, Mao-Bin; Xu, Shuqi; Zhang, Yi-Cheng Percolation on complex networks: theory and application. (English) Zbl 07404931 Phys. Rep. 907, 1-68 (2021). MSC: 82C43 82C26 82C27 05C82 60K35 PDF BibTeX XML Cite \textit{M. Li} et al., Phys. Rep. 907, 1--68 (2021; Zbl 07404931) Full Text: DOI arXiv OpenURL
Salemi, Hosseinali; Buchanan, Austin Parsimonious formulations for low-diameter clusters. (English) Zbl 1452.90083 Math. Program. Comput. 12, No. 3, 493-528 (2020). MSC: 90B10 90C10 90C27 90C35 05C12 05C69 05C85 91D30 PDF BibTeX XML Cite \textit{H. Salemi} and \textit{A. Buchanan}, Math. Program. Comput. 12, No. 3, 493--528 (2020; Zbl 1452.90083) Full Text: DOI OpenURL
Burkhardt, Paul; Faber, Vance; Harris, David G. Bounds and algorithms for graph trusses. (English) Zbl 1447.05193 J. Graph Algorithms Appl. 24, No. 3, 191-214 (2020). MSC: 05C85 68R10 PDF BibTeX XML Cite \textit{P. Burkhardt} et al., J. Graph Algorithms Appl. 24, No. 3, 191--214 (2020; Zbl 1447.05193) Full Text: DOI arXiv OpenURL
Zhang, Feiteng; Liu, Bin; Fang, Qizhi Core decomposition, maintenance and applications. (English) Zbl 1446.05083 Du, Ding-Zhu (ed.) et al., Complexity and approximation. In memory of Ker-I Ko. Cham: Springer. Lect. Notes Comput. Sci. 12000, 205-218 (2020). MSC: 05C82 91D30 PDF BibTeX XML Cite \textit{F. Zhang} et al., Lect. Notes Comput. Sci. 12000, 205--218 (2020; Zbl 1446.05083) Full Text: DOI OpenURL
Borradaile, Glencora; Migler, Theresa; Wilfong, Gordon Density decompositions of networks. (English) Zbl 1419.05174 J. Graph Algorithms Appl. 23, No. 4, 625-651 (2019). MSC: 05C70 05C82 PDF BibTeX XML Cite \textit{G. Borradaile} et al., J. Graph Algorithms Appl. 23, No. 4, 625--651 (2019; Zbl 1419.05174) Full Text: DOI arXiv OpenURL
Furini, Fabio; Ljubić, Ivana; Martin, Sébastien; San Segundo, Pablo The maximum clique interdiction problem. (English) Zbl 1430.90543 Eur. J. Oper. Res. 277, No. 1, 112-127 (2019). MSC: 90C35 90C27 05C85 91D30 05C82 90C10 PDF BibTeX XML Cite \textit{F. Furini} et al., Eur. J. Oper. Res. 277, No. 1, 112--127 (2019; Zbl 1430.90543) Full Text: DOI OpenURL
Banerjee, Niranka; Chakraborty, Sankardeep; Raman, Venkatesh; Satti, Srinivasa Rao Space efficient linear time algorithms for BFS, DFS and applications. (English) Zbl 1430.68173 Theory Comput. Syst. 62, No. 8, 1736-1762 (2018). MSC: 68R10 05C85 68Q25 PDF BibTeX XML Cite \textit{N. Banerjee} et al., Theory Comput. Syst. 62, No. 8, 1736--1762 (2018; Zbl 1430.68173) Full Text: DOI OpenURL
Spinelli, Vincenzo Extended box clustering for classification problems. (English) Zbl 1392.68429 J. Classif. 35, No. 1, 100-123 (2018). MSC: 68U05 05C65 62H30 PDF BibTeX XML Cite \textit{V. Spinelli}, J. Classif. 35, No. 1, 100--123 (2018; Zbl 1392.68429) Full Text: DOI OpenURL
Rota Bulò, Samuel; Pelillo, Marcello Dominant-set clustering: a review. (English) Zbl 1403.68174 Eur. J. Oper. Res. 262, No. 1, 1-13 (2017). MSC: 68R10 05C69 91A80 68-02 PDF BibTeX XML Cite \textit{S. Rota Bulò} and \textit{M. Pelillo}, Eur. J. Oper. Res. 262, No. 1, 1--13 (2017; Zbl 1403.68174) Full Text: DOI OpenURL
Adcock, Aaron B.; Sullivan, Blair D.; Mahoney, Michael W. Tree decompositions and social graphs. (English) Zbl 1461.68139 Internet Math. 12, No. 5, 315-361 (2016). MSC: 68R10 05C05 05C70 68T20 91D30 PDF BibTeX XML Cite \textit{A. B. Adcock} et al., Internet Math. 12, No. 5, 315--361 (2016; Zbl 1461.68139) Full Text: DOI arXiv OpenURL
Lagraa, Sofiane; Seba, Hamida An efficient exact algorithm for triangle listing in large graphs. (English) Zbl 1411.68086 Data Min. Knowl. Discov. 30, No. 5, 1350-1369 (2016). MSC: 68R10 05C82 05C85 68W40 PDF BibTeX XML Cite \textit{S. Lagraa} and \textit{H. Seba}, Data Min. Knowl. Discov. 30, No. 5, 1350--1369 (2016; Zbl 1411.68086) Full Text: DOI HAL OpenURL
Droftina, Uroš; Štular, Mitja; Košir, Andrej A diffusion model for churn prediction based on sociometric theory. (English) Zbl 1414.91304 Adv. Data Anal. Classif., ADAC 9, No. 3, 341-365 (2015). MSC: 91D30 62-07 62P30 05C85 PDF BibTeX XML Cite \textit{U. Droftina} et al., Adv. Data Anal. Classif., ADAC 9, No. 3, 341--365 (2015; Zbl 1414.91304) Full Text: DOI OpenURL
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 PDF BibTeX XML Cite \textit{R. A. Rossi} et al., SIAM J. Sci. Comput. 37, No. 5, C589--C616 (2015; Zbl 1323.05103) Full Text: DOI OpenURL
Le Thi, Hoai An; Nguyen, Manh Cuong; Dinh, Tao Pham A DC programming approach for finding communities in networks. (English) Zbl 1415.68168 Neural Comput. 26, No. 12, 2827-2854 (2014). MSC: 68T05 05C82 PDF BibTeX XML Cite \textit{H. A. Le Thi} et al., Neural Comput. 26, No. 12, 2827--2854 (2014; Zbl 1415.68168) Full Text: DOI OpenURL
Bickle, Allan Degree sequences of monocore graphs. (English) Zbl 1295.05192 Discuss. Math., Graph Theory 34, No. 3, 585-592 (2014). MSC: 05C75 05C07 PDF BibTeX XML Cite \textit{A. Bickle}, Discuss. Math., Graph Theory 34, No. 3, 585--592 (2014; Zbl 1295.05192) Full Text: DOI OpenURL
Fraiman, Ricardo; Ghattas, Badih; Svarc, Marcela Interpretable clustering using unsupervised binary trees. (English) Zbl 1267.62075 Adv. Data Anal. Classif., ADAC 7, No. 2, 125-145 (2013). MSC: 62H30 05C90 PDF BibTeX XML Cite \textit{R. Fraiman} et al., Adv. Data Anal. Classif., ADAC 7, No. 2, 125--145 (2013; Zbl 1267.62075) Full Text: DOI arXiv Link OpenURL
Gambette, Philippe; Guénoche, Alain Bootstrap clustering for graph partitioning. (English) Zbl 1238.05116 RAIRO, Oper. Res. 45, No. 4, 339-352 (2011). MSC: 05C22 05C70 05C85 90C35 62F40 PDF BibTeX XML Cite \textit{P. Gambette} and \textit{A. Guénoche}, RAIRO, Oper. Res. 45, No. 4, 339--352 (2011; Zbl 1238.05116) Full Text: DOI EuDML Link OpenURL
Porumbel, Daniel Cosmin; Hao, Jin Kao; Kuntz, Pascale An efficient algorithm for computing the distance between close partitions. (English) Zbl 1209.68352 Discrete Appl. Math. 159, No. 1, 53-59 (2011). MSC: 68R05 05A05 PDF BibTeX XML Cite \textit{D. C. Porumbel} et al., Discrete Appl. Math. 159, No. 1, 53--59 (2011; Zbl 1209.68352) Full Text: DOI OpenURL
Denœud-Belgacem, Lucile Transfer distance between partitions and search of dense zones in graphs. (English) Zbl 1188.05020 4OR 7, No. 4, 395-398 (2009). MSC: 05A18 05C42 05C90 05D99 90C27 90C35 92B05 PDF BibTeX XML Cite \textit{L. Denœud-Belgacem}, 4OR 7, No. 4, 395--398 (2009; Zbl 1188.05020) Full Text: DOI OpenURL