# Finding a Minimum Feedback Arc Set in Reducible Flow Graphs

@article{Ramachandran1988FindingAM, title={Finding a Minimum Feedback Arc Set in Reducible Flow Graphs}, author={Vijaya Ramachandran}, journal={J. Algorithms}, year={1988}, volume={9}, pages={299-313} }

- Published in J. Algorithms 1988
DOI:10.1016/0196-6774(88)90022-3

Abstract We present a polynomial-time algorithm for finding a minimum weight feedback arc set (FAS) in arc-weighted reducible flow graphs and for finding a minimum weight feedback vertex set (FVS) in vertex-weighted reducible flow graphs. The algorithm has time complexity O(mn 2 log ( n 2 m )) , where n is the number of vertices and m is the number of arcs in the reducible flow graph. For unweighted reducible flow graphs, the algorithm for FAS has time complexity O( min (mn 5 3 , m 2 )) . We… CONTINUE READING

#### Citations

##### Publications citing this paper.

SHOWING 1-10 OF 29 CITATIONS

## Title An efficient algorithm for finding maximum cycle packings inreducible flow graphs

VIEW 10 EXCERPTS

CITES BACKGROUND & METHODS

HIGHLY INFLUENCED

## A Contraction Algorithm for finding Minimal Feedback Sets

VIEW 4 EXCERPTS

CITES METHODS

HIGHLY INFLUENCED

## An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs

VIEW 10 EXCERPTS

CITES BACKGROUND & METHODS

HIGHLY INFLUENCED

## An Enhanced Reconfiguration for Deterministic Transmission in Time-Triggered Networks

VIEW 2 EXCERPTS

CITES BACKGROUND

## A Program Slicing-Based Bayesian Network Model for Change Impact Analysis

VIEW 1 EXCERPT

CITES METHODS

## A Study of Optimized Caching and User Mobility in Wireless Cache-enabled Networks

VIEW 1 EXCERPT

CITES BACKGROUND

## Greedy Caching: An optimized content placement strategy for information-centric networks

VIEW 1 EXCERPT

CITES BACKGROUND

## Scalable algorithms for misinformation prevention in social networks

VIEW 2 EXCERPTS

CITES BACKGROUND

## A min-max relation in flowgraphs and some applications

VIEW 1 EXCERPT

CITES METHODS

## Bayesian Network Learning via Topological Order

VIEW 1 EXCERPT

CITES BACKGROUND

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 13 REFERENCES

## TARJAN, “Data Structures and Network Algorithms,

VIEW 12 EXCERPTS

HIGHLY INFLUENTIAL

## A LINEAR TIME ALGORITHM FOR FINDING MINIMUM CUTSETS IN REDUCIBLE GRAPHS

VIEW 8 EXCERPTS

HIGHLY INFLUENTIAL

## A Minimax Arc Theorem for Reducible Flow Graphs

VIEW 1 EXCERPT

## Fast parallel algorithms for reducible flow graphs, in “Concurrent Computations: Algorithms, Architecture and Technology

## The complexity of minimum cut and maximum flow problems on an acyclic network, Networks

VIEW 2 EXCERPTS

## TABJAN, A new approach to the maximum flow problem, in “Proceedings, 18th Amm

VIEW 3 EXCERPTS

## TARJAN, A linear-time algorithm for a special case of disjoint set union, in “Proceedings 15th AMU

## PAPADIMITRIOU AND K. STBIGLIIZ, “Combinatorial Optimization: Algorithms and Complexity,

VIEW 2 EXCERPTS