Graph orientation and flows over time

DOI10.1007/978-3-319-13075-0_58MaRDI QIDQ2942675zbMATH OpenOpenAlexFDO

Authors Ashwin Arulselvan, Martin Groß, Martin Skutella

Publication date 11 September 2015

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://strathprints.strath.ac.uk/55782/

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• Graph orientation and flows over time
• The Maximum Flow Problem for Oriented Flows
• Quickest Flows Over Time
• Dynamic multicommodity contraflow problem with asymmetric transit times
• Multicommodity flows over time: Efficient algorithms and complexity

Cited in

(5)

• Exploiting Bounded Signal Flow for Graph Orientation Based on Cause–Effect Pairs
• Graph orientation and flows over time
• Degree-constrained orientations of embedded graphs
• Multi-commodity flow problem on lossy network with partial lane reversals
• Optimal Reconfiguration of Network with Variant Transmission Times on Arcs

This page was built for publication: Graph orientation and flows over time

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