Packing feedback arc sets in reducible flow graphs

Han Xiao ()
Additional contact information
Han Xiao: The University of Hong Kong

Journal of Combinatorial Optimization, 2016, vol. 32, issue 3, No 20, 959 pages

Abstract: Abstract In this paper we establish a min–max relation in arc-weighted reducible flow graphs. In particular, we prove that the maximum cardinality of feedback arc set packings equals the minimum total weight of cycles. We also present an $$O(n^2 m)$$ O ( n 2 m ) algorithm for finding a maximum feedback arc set packing in reducible flow graphs.

Keywords: Min–max relation; Feedback arc set; Packing; Reducible flow graph; Algorithm (search for similar items in EconPapers)
Date: 2016
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-015-9922-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:32:y:2016:i:3:d:10.1007_s10878-015-9922-6

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-015-9922-6

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().