Pages that link to "Item:Q5474650"
From MaRDI portal
The following pages link to Lower Bounds and Algorithms for Dominating Sets in Web Graphs (Q5474650):
Displaying 15 items.
- On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size (Q499360) (← links)
- Upper signed \(k\)-domination in a general graph (Q765509) (← links)
- Upper bounds for \(\alpha \)-domination parameters (Q844230) (← links)
- Uncertain weighted dominating set: a prototype application on natural disaster relief management (Q1797772) (← links)
- Dominating problems in swapped networks (Q2629991) (← links)
- Near-Optimal Dominating Sets via Random Sampling (Q2830067) (← links)
- Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem (Q2940057) (← links)
- The Domination Number of On-line Social Networks and Random Geometric Graphs (Q2948462) (← links)
- Techniques for analyzing dynamic random graph models of web-like networks: An overview (Q3515881) (← links)
- (Q4558552) (← links)
- Independent strong domination in complementary prisms (Q4957962) (← links)
- Giant descendant trees, matchings, and independent sets in age-biased attachment graphs (Q5086992) (← links)
- Domination problems on P<sub>5</sub>-free graphs (Q5248877) (← links)
- Vertex Pursuit Games in Stochastic Network Models (Q5458505) (← links)
- Independent strong weak domination: A mathematical programming approach (Q5858171) (← links)
