Dominating sets of random 2-in 2-out directed graphs (Q1010736)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Dominating sets of random 2-in 2-out directed graphs |
scientific article; zbMATH DE number 5540934
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dominating sets of random 2-in 2-out directed graphs |
scientific article; zbMATH DE number 5540934 |
Statements
Dominating sets of random 2-in 2-out directed graphs (English)
0 references
7 April 2009
0 references
Summary: We analyse an algorithm for finding small dominating sets of 2-in 2-out directed graphs using a deprioritised algorithm and differential equations. This deprioritised approach determines an a.a.s.\ upper bound of \(0.39856n\) on the size of the smallest dominating set of a random 2-in 2-out digraph on \(n\) vertices. Direct expectation arguments determine a corresponding lower bound of \(0.3495n\).
0 references
small dominating sets
0 references
2-in 2-out directed graphs
0 references
2-in 2-out digraphs
0 references
deprioritised algorithm
0 references
0.7942216396331787
0 references
0.7923411726951599
0 references
0.7860567569732666
0 references
0.7810772061347961
0 references
0.7790791988372803
0 references
