Corpus ID: 13371883

A FAST EFFECTIVE HEURISTIC FOR THE FEEDBACK ARC SET PROBLEM

@inproceedings{Eades1993AFE,
  title={A FAST EFFECTIVE HEURISTIC FOR THE FEEDBACK ARC SET PROBLEM},
  author={P. Eades},
  year={1993}
}
Let G V A denote a simple connected directed graph and let n jV j m jAj where n m n A feedback arc set FAS of G denoted R G is a possibly empty set of arcs whose reversal makes G acyclic A minimum feedback arc set of G denoted R G is a FAS of minimum cardinality r G the computa tion of R G is called the FAS problem For every n let n denote the maximum over all digraphs G of order n of jR G j Berger and Shor have recently published an algorithm which for a given digraph G computes a FAS whose… Expand
16 Citations
Exact Elimination of Cycles in Graphs
  • D. Raible, H. Fernau
  • Mathematics, Computer Science
  • Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs
  • 2007
  • 1
  • PDF
Upward planarization and layout
  • PDF
Computing Quasi-Upward Planar Drawings of Mixed Graphs
  • 5
Trading routing diversity for better network performance
  • X. Zhang, W. Dong, W. Ren
  • Computer Science
  • 2016 IEEE 24th International Conference on Network Protocols (ICNP)
  • 2016
  • 1
  • PDF
How Good is Weak-Stabilization?
  • 5
  • PDF
NetFork: Mapping Time to Space in Network Visualization
  • 6
SCARPA: scaffolding reads with practical algorithms
  • 73
  • PDF
...
1
2
...

References

Optimal ranking of tournaments
  • J. Spencer
  • Mathematics, Computer Science
  • Networks
  • 1971
  • 52