Lower Bounds and Algorithms for Dominating Sets in Web Graphs
From MaRDI portal
Recommendations
Cited in
(21)- Dominating sets of random 2-in 2-out directed graphs
- Dominating sets in social network graphs
- Uncertain weighted dominating set: a prototype application on natural disaster relief management
- Dominating problems in swapped networks
- Near-optimal dominating sets via random sampling
- Benders decomposition, branch-and-cut, and hybrid algorithms for the minimum connected dominating set problem
- The domination number of on-line social networks and random geometric graphs
- Techniques for analyzing dynamic random graph models of web-like networks: An overview
- Reward maximization under uncertainty: leveraging side-observations on networks
- Independent strong domination in complementary prisms
- On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size
- Giant descendant trees, matchings, and independent sets in age-biased attachment graphs
- Domination problems on \(P_{5}\)-free graphs
- Algorithms and Models for the Web-Graph
- Vertex Pursuit Games in Stochastic Network Models
- Independent strong weak domination: A mathematical programming approach
- The iterated local transitivity model for tournaments
- (t, r)-broadcast domination in graphs
- Some general results on paired disjunctive domination and calculations in certain Mycielski graphs
- Upper signed \(k\)-domination in a general graph
- Upper bounds for \(\alpha \)-domination parameters
This page was built for publication: Lower Bounds and Algorithms for Dominating Sets in Web Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5474650)
