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