Interval Analysis on Directed Acyclic Graphs for Global Optimization

2005 ◽  
Vol 33 (4) ◽  
pp. 541-562 ◽  
Author(s):  
Hermann Schichl ◽  
Arnold Neumaier
Keyword(s):  
Global Optimization ◽  
Interval Analysis ◽  
Directed Acyclic Graphs ◽  
Acyclic Graphs

Weighted Independent Directed Acyclic Graphs for Resilient and Efficient Multipath Routing

2013 ◽  
Vol 3 (3) ◽  
pp. 1
Author(s):  
M. Ramakrishnan ◽  
Sowmya Swaminathan ◽  
Jayaganesan Chandresekaran
Keyword(s):  
Multipath Routing ◽  
Directed Acyclic Graphs ◽  
Acyclic Graphs

A Nettree for Simple Paths with Length Constraint and the Longest Path in Directed Acyclic Graphs

2012 ◽  
Vol 35 (10) ◽  
pp. 2194 ◽  
Author(s):  
Yan LI ◽  
Le SUN ◽  
Huai-Zhong ZHU ◽  
You-Xi WU
Keyword(s):  
Directed Acyclic Graphs ◽  
Length Constraint ◽  
Acyclic Graphs ◽  
Longest Path ◽  
Simple Paths

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.

Efficient coding of labeled directed acyclic graphs

2003 ◽  
Vol 7 (5) ◽  
pp. 350-356 ◽  
Author(s):  
B. Steinsky
Keyword(s):  
Directed Acyclic Graphs ◽  
Efficient Coding ◽  
Acyclic Graphs

PATTERN MATCHING CODE MINIMIZATION IN REWRITING-BASED PROGRAMMING LANGUAGES

2002 ◽  
Vol 13 (06) ◽  
pp. 873-887
Author(s):  
NADIA NEDJAH ◽  
LUIZA DE MACEDO MOURELLE
Keyword(s):  
Programming Languages ◽  
Pattern Matching ◽  
Term Rewriting ◽  
Directed Acyclic Graphs ◽  
Tree Automaton ◽  
Minimal Tree ◽  
Term Rewriting Systems ◽  
Rewriting Systems ◽  
Acyclic Graphs ◽  
Space Requirements

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.

scholarly journals Learning Bayesian Network Classifiers: Searching in a Space of Partially Directed Acyclic Graphs

2005 ◽  
Vol 59 (3) ◽  
pp. 213-235 ◽  
Author(s):  
Silvia Acid ◽  
Luis M. de Campos ◽  
Javier G. Castellano
Keyword(s):  
Bayesian Network ◽  
Directed Acyclic Graphs ◽  
Bayesian Network Classifiers ◽  
Acyclic Graphs

scholarly journals Response to Letter to the Editor, “Directed Acyclic Graphs for Oral Disease Research”

2016 ◽  
Vol 95 (11) ◽  
pp. 1315-1315
Author(s):  
A.A. Akinkugbe ◽  
S. Sharma ◽  
R. Ohrbach ◽  
G.D. Slade ◽  
C. Poole
Keyword(s):  
Directed Acyclic Graphs ◽  
Oral Disease ◽  
Disease Research ◽  
Letter To The Editor ◽  
Acyclic Graphs
Sign in / Sign up

Export Citation Format

Share Document