Finding a minimum feedback arc set in reducible flow graphs

DOI10.1016/0196-6774(88)90022-3MaRDI QIDQ3796774zbMATH OpenOpenAlexFDO

Authors Vijaya Ramachandran

Publication date 1988

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(88)90022-3

zbMATH Keywords

flow networksminimum weight feedback arc setreducible flow graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Programming involving graphs or networks (90C35)

Recommendations

• Packing feedback arc sets in reducible flow graphs
• A Minimax Arc Theorem for Reducible Flow Graphs
• The minimum feedback arc set problem and the acyclic disconnection for graphs
• scientific article; zbMATH DE number 1526336
• An exact method for the minimum feedback arc set problem
• The Minimal Feedback Arc Set Problems^*
• On locating minimum feedback vertex sets
• Minimum feedback arc set of \(m\)-free digraphs
• Minimum feedback arc sets in rotator and incomplete rotator graphs
• Optimal segmentation of directed graph and the minimum number of feedback arcs

Cited in

(21)

• On locating minimum feedback vertex sets
• More facets from fences for linear ordering and acyclic subgraph polytopes
• Approximations for the maximum acyclic subgraph problem
• Solving problems for maximal reducible flowgraphs.
• A \(\min\)-\(\max\) relation in flowgraphs and some applications
• Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of chip-firing game on directed graphs
• Parallel Algorithms for Reducible Flow Graphs
• A Minimax Arc Theorem for Reducible Flow Graphs
• Packing feedback arc sets in reducible flow graphs
• Feedback vertex sets and cyclically reducible graphs
• scientific article; zbMATH DE number 4064732 (Why is no real title available?)
• The parallel complexity of approximation algorithms for the maximum acyclic subgraph problem
• Bayesian network learning via topological order
• Minimum feedback arc sets in rotator and incomplete rotator graphs
• An exact method for the minimum feedback arc set problem
• A fast and effective algorithm for the feedback arc set problem
• The Minimal Feedback Arc Set Problems^*
• Comments on “An Exact Method for the Minimum Feedback Arc Set Problem”
• Efficient heuristics to compute minimal and stable feedback arc sets
• A fast and effective heuristic for the feedback arc set problem
• Exact localisations of feedback sets

This page was built for publication: Finding a minimum feedback arc set in reducible flow graphs

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