Approximating Dual Algorithm for Degree-Bounded Minimum Spanning Trees of Directed Acyclic Graphs

2012 ◽  
Vol 5 (2) ◽  
pp. 929-932
Author(s):  
Hengwu Li ◽  
Zhendong Liu ◽  
Huijian Han ◽  
Zhenzhong Xu ◽  
Xiuyuan Li ◽  
...  
Keyword(s):  
Spanning Trees ◽  
Directed Acyclic Graphs ◽  
Minimum Spanning Trees ◽  
Dual Algorithm ◽  
Acyclic Graphs

scholarly journals Directed acyclic graphs: An under-utilized tool for child maltreatment research

2019 ◽  
Vol 91 ◽  
pp. 78-87 ◽  
Author(s):  
Anna E. Austin ◽  
Tania A. Desrosiers ◽  
Meghan E. Shanahan
Keyword(s):  
Child Maltreatment ◽  
Directed Acyclic Graphs ◽  
Acyclic Graphs

scholarly journals A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees

2020 ◽  
Vol 16 (1) ◽  
pp. 1-27
Author(s):  
Gopal Pandurangan ◽  
Peter Robinson ◽  
Michele Scquizzato
Keyword(s):  
Distributed Algorithm ◽  
Spanning Trees ◽  
Minimum Spanning Trees

scholarly journals On directed analogues of expander and hyperfinite graph sequences

2021 ◽  
pp. 1-14
Author(s):  
Endre Csóka ◽  
Łukasz Grabowski
Keyword(s):  
Directed Acyclic Graphs ◽  
Acyclic Graphs ◽  
Probabilistic Construction

Abstract We introduce and study analogues of expander and hyperfinite graph sequences in the context of directed acyclic graphs, which we call ‘extender’ and ‘hypershallow’ graph sequences, respectively. Our main result is a probabilistic construction of non-hypershallow graph sequences.

Sign in / Sign up

Export Citation Format

Share Document