scientific article; zbMATH DE number 6861995

DOI10.4230/LIPICS.ISAAC.2016.62zbMATH Open1398.05206arXiv1611.08803MaRDI QIDQ4636548

Mingyu Xiao, Hiroshi Nagamochi

Publication date: 19 April 2018

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

Title of this publication is not available (Why is that?)

zbMATH Keywords

minimum cuttreeslinear-time algorithmsmaximum flowmultiterminal flow

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Flows in graphs (05C21)

Related Items (4)

Maximal flow in branching trees and binary search trees ⋮ A note on integral generalized flows in directed partial 2-trees ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?)

Recommendations

• Title not available (Why is that?) 👍 👎
• Primal-dual approximation algorithms for integral flow and multicut in trees 👍 👎
• A note on multiflows and treewidth 👍 👎
• Improved algorithms for the multicut and multiflow problems in rooted trees 👍 👎
• Characterizing multiterminal flow networks and computing flows in networks of small treewidth 👍 👎
• A greedy algorithm for multicut and integral multiflow in rooted trees 👍 👎
• Multiway cut and integer flow problems in trees 👍 👎
• Simple linear flow decomposition algorithms on trees, circles, and augmented trees 👍 👎
• On Linear Programming Relaxations for Unsplittable Flow in Trees 👍 👎
• FPT and FPT-Approximation Algorithms for Unsplittable Flow on Trees 👍 👎

This page was built for publication:

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