Integer multiflows in acyclic planar digraphs

DOI10.1007/S00493-023-00065-0MaRDI QIDQ6081412zbMATH OpenOpenAlexFDO

Authors Guyslain Naves

Publication date 4 October 2023

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00493-023-00065-0

zbMATH Keywords

acyclic planar graphsedge-disjoint pathEulerian digraphsinteger multiflowmulticommodity flow

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Directed graphs (digraphs), tournaments (05C20) Flows in graphs (05C21)

Recommendations

• Integer plane multiflows with a mixed number of demands
• The hardness of routing two pairs on one face
• Maximum integer flows in directed planar graphs with vertex capacities and multiple sources and sinks
• Edge disjoint paths and max integral multiflow/min multicut theorems in planar graphs
• An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks

This page was built for publication: Integer multiflows in acyclic planar digraphs

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