References in zbMATH (referenced in 59 articles )

1. Concas, A.; Noschese, S.; Reichel, L.; Rodriguez, G.: A spectral method for bipartizing a network and detecting a large anti-community (2020)
2. Cristofari, Andrea; Rinaldi, Francesco; Tudisco, Francesco: Total variation based community detection using a nonlinear optimization approach (2020)
3. Estrada, Ernesto: `Hubs-repelling’ Laplacian and related diffusion on graphs/networks (2020)
4. Izunaga, Yoichi; Matsui, Tomomi; Yamamoto, Yoshitsugu: A doubly nonnegative relaxation for modularity density maximization (2020)
5. Maske, Charles; Cohen, Jaime; Duarte, Elias P. jun.: Speeding up the Gomory-Hu parallel cut tree algorithm with efficient graph contractions (2020)
6. Shimizu, Satoshi; Yamaguchi, Kazuaki; Masuda, Sumio: A maximum edge-weight clique extraction algorithm based on branch-and-bound (2020)
7. Alqahtani, Hessah; Reichel, Lothar: Generalized block anti-Gauss quadrature rules (2019)
8. Chepoi, Victor; Dragan, Feodor F.; Habib, Michel; Vaxès, Yann; Alrasheed, Hend: Fast approximation of eccentricities and distances in hyperbolic graphs (2019)
9. Karakose, Gokhan; McGarvey, Ronald G.: Optimal detection of critical nodes: improvements to model structure and performance (2019)
10. Matsypura, Dmytro; Veremyev, Alexander; Prokopyev, Oleg A.; Pasiliao, Eduardo L.: On exact solution approaches for the longest induced path problem (2019)
11. Veremyev, Alexander; Prokopyev, Oleg A.; Pasiliao, Eduardo L.: Finding critical links for closeness centrality (2019)
12. Walteros, Jose L.; Veremyev, Alexander; Pardalos, Panos M.; Pasiliao, Eduardo L.: Detecting critical node structures on graphs: a mathematical programming approach (2019)
13. Alqahtani, Hessah; Reichel, Lothar: Simplified anti-Gauss quadrature rules with applications in linear algebra (2018)
14. Estrada, Ernesto; Gambuzza, Lucia Valentina; Frasca, Mattia: Long-range interactions and network synchronization (2018)
15. Nadara, Wojciech; Pilipczuk, Marcin; Rabinovich, Roman; Reidl, Felix; Siebertz, Sebastian: Empirical evaluation of approximation algorithms for generalized graph coloring and uniform quasi-wideness (2018)
16. Xu, Taihua; Yang, Jie; Gou, Guanglei: A force-directed algorithm for drawing directed graphs symmetrically (2018)
17. Allen-Perkins, Alfonso; Pastor, Juan Manuel; Estrada, Ernesto: Two-walks degree assortativity in graphs and networks (2017)
18. Bao, Zhong-Kui; Liu, Jian-Guo; Zhang, Hai-Feng: Identifying multiple influential spreaders by a heuristic clustering algorithm (2017)
19. Dragan, Feodor F.; Köhler, Ekkehard; Alrasheed, Hend: Eccentricity approximating trees (2017)
20. Gross, Elizabeth; Petrović, Sonja; Stasi, Despina: Goodness of fit for log-linear network models: dynamic Markov bases using hypergraphs (2017)