scholarly journals NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs

2015 ◽  
Vol 29 (4) ◽  
pp. 1931-1960 ◽  
Author(s):  
Sepp Hartung ◽  
André Nichterlein
Keyword(s):  
Directed Acyclic Graphs ◽  
Fixed Parameter Tractability ◽  
Degree Sequences ◽  
Acyclic Graphs ◽  
Fixed Parameter ◽  
Np Hardness

scholarly journals Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs

2015 ◽  
Vol 29 (1) ◽  
pp. 122-144 ◽  
Author(s):  
Stefan Kratsch ◽  
Marcin Pilipczuk ◽  
MichaŁ Pilipczuk ◽  
Magnus Wahlström
Keyword(s):  
Directed Acyclic Graphs ◽  
Fixed Parameter Tractability ◽  
Acyclic Graphs ◽  
Fixed Parameter

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 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