Pages that link to "Item:Q476891"
From MaRDI portal
The following pages link to Inapproximability of dominating set on power law graphs (Q476891):
Displaying 10 items.
- Minimum vertex cover in generalized random graphs with power law degree distribution (Q306728) (← links)
- Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph (Q526869) (← links)
- An order-based algorithm for minimum dominating set with application in graph mining (Q781288) (← links)
- Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs (Q1676361) (← links)
- Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket (Q1704581) (← links)
- Greed is good for deterministic scale-free networks (Q2205637) (← links)
- Combinatorial properties of Farey graphs (Q2333787) (← links)
- Near-Optimal Dominating Sets via Random Sampling (Q2830067) (← links)
- EDGE DOMINATION NUMBER AND THE NUMBER OF MINIMUM EDGE DOMINATING SETS IN PSEUDOFRACTAL SCALE-FREE WEB AND SIERPIŃSKI GASKET (Q5025346) (← links)
- COMBINATORIAL PROPERTIES FOR A CLASS OF SIMPLICIAL COMPLEXES EXTENDED FROM PSEUDO-FRACTAL SCALE-FREE WEB (Q6158062) (← links)