Packing feedback arc sets in reducible flow graphs

DOI10.1007/s10878-015-9922-6zbMath1354.90118OpenAlexW946272560MaRDI QIDQ326500

Han Xiao

Publication date: 12 October 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-015-9922-6

zbMATH Keywords

algorithmpackingfeedback arc setmin-max relationreducible flow graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Minimax problems in mathematical programming (90C47) Combinatorial optimization (90C27)

Related Items (1)

On ideal semicomplete digraphs

Cites Work

• Testing flow graph reducibility
• An efficient algorithm for finding maximum cycle packings in reducible flow graphs
• A Minimax Arc Theorem for Reducible Flow Graphs
• Finding a minimum feedback arc set in reducible flow graphs
• A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs
• Characterizations of Reducible Flow Graphs
• Flow Graph Reducibility
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Packing feedback arc sets in reducible flow graphs