scientific article; zbMATH DE number 6469213
From MaRDI portal
Publication:5501331
zbMATH Open1318.91157MaRDI QIDQ5501331FDOQ5501331
Authors: Stephen Eubank, V. S. Anil Kumar, Aravind Srinivasan, Nan Wang, Madhav V. Marathe
Publication date: 3 August 2015
Title of this publication is not available (Why is that?)
Recommendations
- Structural search and optimization in social networks
- Analysis of large-scale social and information networks
- scientific article; zbMATH DE number 1072402
- Algorithms and dynamical models for communities and reputation in social networks
- Social networks. Modelling and analysis
- Social network analysis and applications: A review of the broad research aspects of social network structure
- scientific article; zbMATH DE number 1168330
Graph theory (including graph drawing) in computer science (68R10) Clustering in the social and behavioral sciences (91C20) Social networks; opinion dynamics (91D30) Approximation algorithms (68W25)
Cited In (19)
- Exact and heuristic algorithms for the domination problem
- Approximability of the firefighter problem. Computing cuts over time
- Portal nodes screening for large scale social networks
- 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
- Minimum vertex cover in generalized random graphs with power law degree distribution
- Approximability of the vertex cover problem in power-law graphs
- New techniques for approximating optimal substructure problems in power-law graphs
- Inapproximability of dominating set on power law graphs
- Finding the probability of infection in an SIR network is NP-hard
- Heuristics for \(k\)-domination models of facility location problems in street networks
- Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs
- Lotkaian informetrics and applications to social networks
- Computing an effective decision making group of a society using social network analysis
- Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism
- A polynomial-time approximation to a minimum dominating set in a graph
- Towards a Study of Low-Complexity Graphs
- On positive influence dominating sets in social networks
- Two-Population SIR Model and Strategies to Reduce Mortality in Pandemics
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501331)