Pages that link to "Item:Q5211634"
From MaRDI portal
The following pages link to Broadcasting on Random Directed Acyclic Graphs (Q5211634):
Displaying 9 items.
- Optimal and near-optimal broadcast in random graphs (Q921019) (← links)
- Broadcasting in DMA-bound bounded degree graphs (Q1199443) (← links)
- Sufficient condition for root reconstruction by parsimony on binary trees with general weights (Q2064854) (← links)
- Broadcasting on random recursive trees (Q2117452) (← links)
- How heavy independent sets help to find arborescences with many leaves in DAGs (Q2698292) (← links)
- On Radio Broadcasting in Random Geometric Graphs (Q3540232) (← links)
- Galton--Watson Processes and Their Role as Building Blocks for Branching Processes (Q5074427) (← links)
- Broadcasting in random graphs (Q5967062) (← links)
- Combinatorial statistics and the sciences (Q6118118) (← links)