scientific article; zbMATH DE number 7376084

DOI10.4230/LIPIcs.ICALP.2018.157zbMath1499.90045MaRDI QIDQ5002847

Gal Vardi, Orna Kupferman

Publication date: 28 July 2021

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

graph algorithmsflow network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Real addition and the polynomial hierarchy
• A strongly polynomial minimum cost circulation algorithm
• Parameterized complexity of firefighting
• Maximal Flow Through a Network
• A new approach to the maximum-flow problem
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• On the Complexity of Timetable and Multicommodity Flow Problems
• Saving Critical Nodes with Firefighters is FPT

This page was built for publication: