✦ LIBER ✦

Limitations of acyclic causal graphs for planning

✍ Scribed by Jonsson, Anders; Jonsson, Peter; Lööw, Tomas

Book ID: 121714928
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 408 KB
Volume: 210
Category: Article
ISSN: 0004-3702
DOI: 10.1016/j.artint.2014.02.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Searching for acyclic orientations of gr

Searching for acyclic orientations of graphs

✍ Martin Aigner; Eberhard Triesch; Zsolt Tuza 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 397 KB

We want to find an unknown acyclic orientation ~\* of an (undirected) graph G by testing for certain edges how they are oriented according to ~\*. How many tests do we need in the worst case? We give upper and lower bounds for this number c(G) in terms of the independence number of G and study the c

Using Directed Acyclic Graphs to detect

Using Directed Acyclic Graphs to detect limitations of traditional regression in longitudinal studies

✍ Erica E. M. Moodie; D. A. Stephens 📂 Article 📅 2010 🏛 SP Birkhäuser Verlag Basel 🌐 English ⚖ 165 KB

Efficient algorithms for acyclic colorin

Efficient algorithms for acyclic colorings of graphs

✍ Zhi-Zhong Chen 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 209 KB

Acyclic Edge-Coloring of Planar Graphs

✍ Basavaraju, Manu; Chandran, L. Sunil; Cohen, Nathann; Havet, Frédéric; Müller, T 📂 Article 📅 2011 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 221 KB

An algorithm for generation of s-t acycl

An algorithm for generation of s-t acyclic graphs

✍ Youichi Higashiyama; Hiromu Ariyoshi 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 506 KB