Dominating sets of random 2-in 2-out directed graphs
From MaRDI portal
Recommendations
Cited in
(10)- Directed dominating set problem studied by cavity method: warning propagation and population dynamics
- Near-optimal dominating sets in dense random graphs in polynomial expected time
- Random procedures for dominating sets in graphs
- The 2-tuple dominating independent number of a random graph
- Dominating sets in directed graphs
- Algorithms and Models for the Web-Graph
- The directed dominating set problem: generalized leaf removal and belief propagation
- Statistical mechanics of the directed 2-distance minimal dominating set problem
- Lower Bounds and Algorithms for Dominating Sets in Web Graphs
- Random procedures for dominating sets in bipartite graphs
This page was built for publication: Dominating sets of random 2-in 2-out directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010736)