✦ LIBER ✦

Model Determination for Directed Acyclic Graphs

✍ Scribed by G. Consonni; V. Leucari

Book ID: 108549175
Publisher: John Wiley and Sons
Year: 2001
Weight: 263 KB
Volume: 50
Category: Article
ISSN: 0039-0526
DOI: 10.1111/1467-9884.00275

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Collapsibility for Directed Acyclic Grap

Collapsibility for Directed Acyclic Graphs

✍ XIANCHAO XIE; ZHI GENG 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 738 KB

Compatible prior distributions for direc

Compatible prior distributions for directed acyclic graph models

✍ Alberto Roverato; Guido Consonni 📂 Article 📅 2004 🏛 Blackwell Publishing 🌐 English ⚖ 164 KB

Markov Properties for Acyclic Directed M

Markov Properties for Acyclic Directed Mixed Graphs

✍ THOMAS RICHARDSON 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 177 KB

Signed directed acyclic graphs for causa

Signed directed acyclic graphs for causal inference

✍ Tyler J. VanderWeele; James M. Robins 📂 Article 📅 2010 🏛 Blackwell Publishing 🌐 English ⚖ 670 KB

Shortest path algorithms for nearly acyc

Shortest path algorithms for nearly acyclic directed graphs

✍ Tadao Takaoka 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 496 KB

Abuaiadh and Kingston gave an efficient algorithm for the single source shortest path problem for a nearly acyclic graph with O(m + n log t) computing time, where m and n are the numbers of edges and vertices of the given directed graph and t is the number of delete-min operations in the priority qu

A parallel search algorithm for directed

A parallel search algorithm for directed acyclic graphs

✍ Ratan K. Ghosh; G. P. Bhattacharjee 📂 Article 📅 1984 🏛 Springer Netherlands 🌐 English ⚖ 860 KB