Maximum flows in parametric graph templates

DOI10.1007/978-3-031-30448-4_8MaRDI QIDQ6057318zbMATH OpenFDO

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

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 algorithmsgraph theorymaximum flow

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A Fast Parametric Maximum Flow Algorithm and Applications
• Enumerating parametric global minimum cuts by random interleaving
• Graph expressions and graph rewritings
• Hierarchical graph transformation
• scientific article; zbMATH DE number 3854804 (Why is no real title available?)
• scientific article; zbMATH DE number 4051026 (Why is no real title available?)
• scientific article; zbMATH DE number 17539 (Why is no real title available?)
• scientific article; zbMATH DE number 1405806 (Why is no real title available?)
• scientific article; zbMATH DE number 6297748 (Why is no real title available?)
• Linear and Context-Free Graph Grammars
• Max flows in O(nm) time, or better
• Network flows. Theory, algorithms, and applications.
• Parametric min-cuts analysis in a network.
• Parametric shortest path algorithms with an application to cyclic staffing
• Some efficient solutions to the affine scheduling problem. I: One- dimensional time
• Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs
• Structural and algorithmic properties for parametric minimum cuts

Cited in

(2)

• scientific article; zbMATH DE number 5585920 (Why is no real title available?)
• scientific article; zbMATH DE number 6297748 (Why is no real title available?)

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

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