Exploiting Bounded Signal Flow for Graph Orientation Based on Cause–Effect Pairs

DOI10.1007/978-3-642-19754-3_12zbMath1325.05165OpenAlexW2397577094MaRDI QIDQ2999338

Dominikus Krüger, Rolf Niedermeier, Johannes Uhlmann, Britta Dorn, Falk Hüffner

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Flows in graphs (05C21)

Related Items (6)

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 ⋮ Approximation Algorithms for Orienting Mixed Graphs ⋮ Improved approximation for orienting mixed graphs

This page was built for publication: Exploiting Bounded Signal Flow for Graph Orientation Based on Cause–Effect Pairs