References in zbMATH (referenced in 28 articles )

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

1 2 next

  1. Bao, Zhong-Kui; Liu, Jian-Guo; Zhang, Hai-Feng: Identifying multiple influential spreaders by a heuristic clustering algorithm (2017)
  2. Dragan, Feodor F.; Köhler, Ekkehard; Alrasheed, Hend: Eccentricity approximating trees (2017)
  3. Gross, Elizabeth; Petrović, Sonja; Stasi, Despina: Goodness of fit for log-linear network models: dynamic Markov bases using hypergraphs (2017)
  4. Veremyev, Alexander; Prokopyev, Oleg A.; Pasiliao, Eduardo L.: Finding groups with maximum betweenness centrality (2017)
  5. Arrigo, Francesca; Benzi, Michele; Fenu, Caterina: Computation of generalized matrix functions (2016)
  6. Strash, Darren: On the power of simple reductions for the maximum independent set problem (2016)
  7. Veremyev, Alexander; Prokopyev, Oleg A.; Butenko, Sergiy; Pasiliao, Eduardo L.: Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs (2016)
  8. Estrada, Ernesto; Arrigo, Francesca: Predicting triadic closure in networks using communicability distance functions (2015)
  9. Lü, Linyuan; Pan, Liming; Zhou, Tao; Zhang, Yi-Cheng; Stanley, H.Eugene: Toward link predictability of complex networks (2015)
  10. Cafieri, Sonia; Costa, Alberto; Hansen, Pierre: Reformulation of a model for hierarchical divisive graph modularity maximization (2014)
  11. Costa, Alberto; Hansen, Pierre: A locally optimal hierarchical divisive heuristic for bipartite modularity maximization (2014)
  12. Pajouh, Foad Mahdavi; Miao, Zhuqi; Balasundaram, Balabhaskar: A branch-and-bound approach for maximum quasi-cliques (2014)
  13. Ribeiro, Pedro; Silva, Fernando: G-Tries: a data structure for storing and finding subgraphs (2014)
  14. Veremyev, Alexander; Prokopyev, Oleg A.; Boginski, Vladimir; Pasiliao, Eduardo L.: Finding maximum subgraphs with relatively large vertex connectivity (2014)
  15. Crescenzi, Pilu; Grossi, Roberto; Habib, Michel; Lanzi, Leonardo; Marino, Andrea: On computing the diameter of real-world undirected graphs (2013)
  16. Fenu, C.; Martin, D.; Reichel, L.; Rodriguez, G.: Network analysis via partial spectral factorization and Gauss quadrature (2013)
  17. Krivitsky, Pavel N.: Exponential-family random graph models for valued networks (2012)
  18. McClosky, Benjamin; Hicks, Illya V.: Combinatorial algorithms for the maximum $k$-plex problem (2012)
  19. Moser, Hannes; Niedermeier, Rolf; Sorge, Manuel: Exact combinatorial algorithms and experiments for finding maximum $k$-plexes (2012)
  20. 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)

1 2 next