scientific article; zbMATH DE number 6469213

zbMath1318.91157MaRDI QIDQ5501331

Nan Wang, Aravind Srinivasan, Stephen Eubank, V. S. Anil Kumar, Madhav V. Marathe

Publication date: 3 August 2015

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Clustering in the social and behavioral sciences (91C20) Social networks; opinion dynamics (91D30) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Related Items (15)

Two-Population SIR Model and Strategies to Reduce Mortality in Pandemics ⋮ Minimum vertex cover in generalized random graphs with power law degree distribution ⋮ A polynomial-time approximation to a minimum dominating set in a graph ⋮ Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs ⋮ Heuristics for \(k\)-domination models of facility location problems in street networks ⋮ Approximability of the vertex cover problem in power-law graphs ⋮ Finding the probability of infection in an SIR network is NP-hard ⋮ On positive influence dominating sets in social networks ⋮ Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism ⋮ Approximability of the firefighter problem. Computing cuts over time ⋮ New techniques for approximating optimal substructure problems in power-law graphs ⋮ Inapproximability of dominating set on power law graphs ⋮ Computing an effective decision making group of a society using social network analysis ⋮ Main-memory triangle computations for very large (sparse (power-law)) graphs ⋮ Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies

This page was built for publication: