References in zbMATH (referenced in 22 articles )

Showing results 1 to 20 of 22.
Sorted by year (citations)

1 2 next

  1. Arrigo, Francesca; Benzi, Michele; Fenu, Caterina: Computation of generalized matrix functions (2016)
  2. Veremyev, Alexander; Prokopyev, Oleg A.; Butenko, Sergiy; Pasiliao, Eduardo L.: Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs (2016)
  3. Estrada, Ernesto; Arrigo, Francesca: Predicting triadic closure in networks using communicability distance functions (2015)
  4. Cafieri, Sonia; Costa, Alberto; Hansen, Pierre: Reformulation of a model for hierarchical divisive graph modularity maximization (2014)
  5. Costa, Alberto; Hansen, Pierre: A locally optimal hierarchical divisive heuristic for bipartite modularity maximization (2014)
  6. Pajouh, Foad Mahdavi; Miao, Zhuqi; Balasundaram, Balabhaskar: A branch-and-bound approach for maximum quasi-cliques (2014)
  7. Ribeiro, Pedro; Silva, Fernando: G-Tries: a data structure for storing and finding subgraphs (2014)
  8. Veremyev, Alexander; Prokopyev, Oleg A.; Boginski, Vladimir; Pasiliao, Eduardo L.: Finding maximum subgraphs with relatively large vertex connectivity (2014)
  9. Crescenzi, Pilu; Grossi, Roberto; Habib, Michel; Lanzi, Leonardo; Marino, Andrea: On computing the diameter of real-world undirected graphs (2013)
  10. Fenu, C.; Martin, D.; Reichel, L.; Rodriguez, G.: Network analysis via partial spectral factorization and Gauss quadrature (2013)
  11. Krivitsky, Pavel N.: Exponential-family random graph models for valued networks (2012)
  12. McClosky, Benjamin; Hicks, Illya V.: Combinatorial algorithms for the maximum $k$-plex problem (2012)
  13. Moser, Hannes; Niedermeier, Rolf; Sorge, Manuel: Exact combinatorial algorithms and experiments for finding maximum $k$-plexes (2012)
  14. Shi, Quan; Xiao, Yanghua; Bessis, Nik; Lu, Yiqi; Chen, Yaoliang; Hill, Richard: Optimizing $K^2$ trees: a case for validating the maturity of network of practices (2012)
  15. Balasundaram, Balabhaskar; Butenko, Sergiy; Hicks, Illya V.: Clique relaxations in social network analysis: the maximum $k$-plex problem (2011)
  16. Batagelj, Vladimir; Zaveršnik, Matjaž: Fast algorithms for determining (generalized) core groups in social networks (2011)
  17. Costa, L.da F.; Rodrigues, F.A.; Boas, P.R.Villas: Modeling the evolution of complex networks through the path-star transformation and optimal multivariate methods (2010)
  18. Bramandia, Ramadhana; Cheng, Jiefeng; Choi, Byron; Yu, Jeffrey Xu: Optimizing updates of recursive XML views of relations (2009)
  19. Estrada, Ernesto; Hatano, Naomichi: Communicability graph and community structures in complex networks (2009)
  20. Zhou, Tao; Lü, Linyuan; Zhang, Yi-Cheng: Predicting missing links via local information (2009)

1 2 next