Exploiting Bounded Signal Flow for Graph Orientation Based on Cause–Effect Pairs
DOI10.1007/978-3-642-19754-3_12zbMATH Open1325.05165OpenAlexW2397577094MaRDI QIDQ2999338FDOQ2999338
Authors: B. Dorn, Falk Hüffner, Dominikus Krüger, Rolf Niedermeier, Johannes Uhlmann 
Publication date: 12 May 2011
Published in: Theory and Practice of Algorithms in (Computer) Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-19754-3_12
Recommendations
- Fast causal orientation learning in directed acyclic graphs
- Signal Processing on Graphs: Causal Modeling of <italic>Un</italic>structured Data
- Graphical matroid for causality assignment in bond graphs
- scientific article; zbMATH DE number 7306925
- Orientation embedding of signed graphs
- Contextual equivalence for signal flow graphs
- Graph orientation and flows over time
- Graph orientation and flows over time
- Signed Directed Acyclic Graphs for Causal Inference
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Flows in graphs (05C21)
Cited In (6)
- Improved approximation for orienting mixed graphs
- Approximation algorithms for orienting mixed graphs
- Approximation algorithms for orienting mixed graphs
- On making directed graphs transitive
- A note on the parameterized complexity of unordered maximum tree orientation
- Compact navigation and distance oracles for graphs with small treewidth
This page was built for publication: Exploiting Bounded Signal Flow for Graph Orientation Based on Cause–Effect Pairs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2999338)
