Tight upper bounds for minimum feedback arc sets of regular graphs

DOI10.1007/978-3-642-45043-3_26zbMATH Open1417.68052OpenAlexW2286149865MaRDI QIDQ2864310FDOQ2864310

Authors: Kathrin Hanauer, Christopher Auer, Franz J. Brandenburg 

Publication date: 6 December 2013

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-45043-3_26

Recommendations

• scientific article; zbMATH DE number 825126
• Combinatorial algorithms for feedback problems in directed graphs
• Feedback arc set in bipartite tournaments is NP-complete
• The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
• An exact method for the minimum feedback arc set problem

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cited In (7)

• Feedback arc set. A history of the problem and algorithms
• The feedback arc set problem with triangle inequality is a vertex cover problem
• Title not available (Why is that?)
• On the hardness of approximating some NP-optimization problems related to minimum linear ordering problem
• Extremal results on feedback arc sets in digraphs
• The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
• The minimum feedback arc set problem and the acyclic disconnection for graphs

This page was built for publication: Tight upper bounds for minimum feedback arc sets of regular graphs

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