Computation in Causal Graphs

DOI10.7155/jgaa.00493zbMath1411.05244OpenAlexW2937255894MaRDI QIDQ5377356

Adrian Vetta, Juli Atherton, Derek Ruths

Publication date: 24 May 2019

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00493

zbMATH Keywords

causal modelsmultiple-setpair framework

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On rigid circuit graphs
• Parameterized graph separation problems
• Causal inference in statistics: an overview
• The connected cutset connectivity of a graph
• Star-cutsets and perfect graphs
• Coloring graphs with stable cutsets
• Causation, prediction, and search
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• Geometric algorithms and combinatorial optimization.
• A theorem on graphs
• The Design of Approximation Algorithms
• Connected (s,t)-Vertex Separator Parameterized by Chordality
• A Separator Theorem for Planar Graphs
• Planar Formulae and Their Uses
• Independence properties of directed markov fields
• Approximate max-flow min-(multi)cut theorems and their applications
• NP-completeness of the Planar Separator Problems

This page was built for publication: Computation in Causal Graphs