Computation in causal graphs

DOI10.7155/JGAA.00493MaRDI QIDQ5377356zbMATH OpenOpenAlexFDO

Authors Juli Atherton, Derek Ruths, Adrian Vetta

Publication date 24 May 2019

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

Copyright license Creative Commons Attribution 4.0 International

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)

Recommendations

• Construction of minimal d-separators in a dependency system
• Logic of minimal separation in causal networks
• scientific article; zbMATH DE number 4189228
• Separators and adjustment sets in causal graphs: complete criteria and an algorithmic framework
• Minimal separators in dependency structures: properties and identification

Cites work

• A Separator Theorem for Planar Graphs
• A theorem on graphs
• Approximate max-flow min-(multi)cut theorems and their applications
• Causal inference in statistics: an overview
• Causality. Models, reasoning, and inference
• Causation, prediction, and search
• Coloring graphs with stable cutsets
• Connected (s,t)-vertex separator parameterized by chordality
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• Geometric algorithms and combinatorial optimization.
• scientific article; zbMATH DE number 48812 (Why is no real title available?)
• scientific article; zbMATH DE number 4121482 (Why is no real title available?)
• scientific article; zbMATH DE number 1839431 (Why is no real title available?)
• Independence properties of directed markov fields
• NP-completeness of the Planar Separator Problems
• On rigid circuit graphs
• Parameterized graph separation problems
• Planar Formulae and Their Uses
• Star-cutsets and perfect graphs
• The connected cutset connectivity of a graph
• The design of approximation algorithms

Cited in

(7)

• Graphical matroid for causality assignment in bond graphs
• Compartmental model diagrams as causal representations in relation to DAGs
• Causal computational complexity of distributed processes
• scientific article; zbMATH DE number 4203674 (Why is no real title available?)
• scientific article; zbMATH DE number 1208713 (Why is no real title available?)
• Logic of minimal separation in causal networks
• Construction of minimal d-separators in a dependency system

This page was built for publication: Computation in causal graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5377356)