Maximum flows in parametric graph templates

DOI10.1007/978-3-031-30448-4_8arXiv2307.08420MaRDI QIDQ6057318

Yishai Oltchik, T. Hoefler, Tal Ben-Nun, Lukas Gianinazzi

Publication date: 4 October 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2307.08420

zbMATH Keywords

graph theorygraph algorithmsmaximum flow

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some efficient solutions to the affine scheduling problem. I: One- dimensional time
• Structural and algorithmic properties for parametric minimum cuts
• Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs
• Parametric shortest path algorithms with an application to cyclic staffing
• Hierarchical graph transformation
• Parametric min-cuts analysis in a network.
• Graph expressions and graph rewritings
• A Fast Parametric Maximum Flow Algorithm and Applications
• Enumerating parametric global minimum cuts by random interleaving
• Max flows in O(nm) time, or better
• Linear and Context-Free Graph Grammars

This page was built for publication: Maximum flows in parametric graph templates