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}
}
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

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

  • Algorithmica
  • 2005
VIEW 10 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

An Enhanced Reconfiguration for Deterministic Transmission in Time-Triggered Networks

  • IEEE/ACM Transactions on Networking
  • 2019
VIEW 2 EXCERPTS
CITES BACKGROUND

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

  • 2018 IEEE International Conference on Software Quality, Reliability and Security (QRS)
  • 2018
VIEW 1 EXCERPT
CITES METHODS

Bayesian Network Learning via Topological Order

  • J. Mach. Learn. Res.
  • 2017
VIEW 1 EXCERPT
CITES BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-10 OF 13 REFERENCES

TARJAN, “Data Structures and Network Algorithms,

R E
  • SIAM, Philadelphia,
  • 1983
VIEW 12 EXCERPTS
HIGHLY INFLUENTIAL

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

V. bA.4cIL4NDRAN
  • 1988

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

V. MACHANDRAN
  • 1987
VIEW 2 EXCERPTS

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

R.E.A. GOLDBERG
  • ACM Symp. on Theory of Computing,
  • 1986
VIEW 3 EXCERPTS

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

H. GABOW, E R.
  • ACM Symp. on Theory of Computing,
  • 1983

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

C H.
  • 1982
VIEW 2 EXCERPTS

GYARFAS, Directed graphs and computer programs, in “Problemes Combinatoire et Theorie des Graphes,

A. A. FRANK
  • Colloque Intemationaux C.N.R.S.,
  • 1976