Constrained flows in networks

DOI10.1016/J.TCS.2024.114702MaRDI QIDQ6589851

L. Picasarri-Arrieta, Stéphane Bessy, Jørgen Bang-Jensen

Publication date: 20 August 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

approximation algorithmpolynomial time algorithmflowsNP-complete problemacyclic digraphparameterised complexity(arc-)disjoint paths with prescribed end vertices

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The complexity of finding arc-disjoint branching flows
• Arc-disjoint spanning sub(di)graphs in digraphs
• The \(k\)-splittable flow problem
• The directed subgraph homeomorphism problem
• Approximating the single source unsplittable min-cost flow problem
• The complexity of computing a robust flow
• Balanced branchings in digraphs
• (Arc-)disjoint flows in networks
• Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs
• On the Complexity of Timetable and Multicommodity Flow Problems
• Parameterized Algorithms
• Digraphs
• FPT algorithms for packing \(k\)-safe spanning rooted sub(di)graphs

This page was built for publication: Constrained flows in networks

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