scholarly journals Directed Acyclic Graphs for Oral Disease Research

2016 ◽  
Vol 95 (8) ◽  
pp. 853-859 ◽  
Author(s):  
A.A. Akinkugbe ◽  
S. Sharma ◽  
R. Ohrbach ◽  
G.D. Slade ◽  
C. Poole
2016 ◽  
Vol 95 (11) ◽  
pp. 1315-1315
Author(s):  
A.A. Akinkugbe ◽  
S. Sharma ◽  
R. Ohrbach ◽  
G.D. Slade ◽  
C. Poole

2019 ◽  
Vol 91 ◽  
pp. 78-87 ◽  
Author(s):  
Anna E. Austin ◽  
Tania A. Desrosiers ◽  
Meghan E. Shanahan

Author(s):  
Endre Csóka ◽  
Łukasz Grabowski

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.


2002 ◽  
Vol 13 (06) ◽  
pp. 873-887
Author(s):  
NADIA NEDJAH ◽  
LUIZA DE MACEDO MOURELLE

We compile pattern matching for overlapping patterns in term rewriting systems into a minimal, tree matching automata. The use of directed acyclic graphs that shares all the isomorphic subautomata allows us to reduce space requirements. These are duplicated in the tree automaton. We design an efficient method to identify such subautomata and avoid duplicating their construction while generating the dag automaton. We compute some bounds on the size of the automata, thereby improving on previously known equivalent bounds for the tree automaton.


Sign in / Sign up

Export Citation Format

Share Document