The connection of the acyclic disconnection and feedback arc sets -- on an open problem of Figueroa et al..

DOI10.1016/J.DISC.2024.113958MaRDI QIDQ6494939

Lukas Vogl, Laura Vargas Koch

Publication date: 30 April 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

feedback arc setacyclic disconnectionoriented planar graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• On the acyclic disconnection of multipartite tournaments
• The minimum feedback arc set problem and the acyclic disconnection for graphs
• Circulant tournaments of prime order are tight
• The acyclic disconnection of a digraph
• Approximating minimum feedback sets and multicuts in directed graphs
• The dichromatic number of a digraph
• Packing directed circuits fractionally
• On the acyclic disconnection and the girth
• The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
• The importance of being biased
• Reducibility among Combinatorial Problems
• Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
• Ranking Tournaments
• Aggregating inconsistent information
• Ordering by weighted number of wins gives a good ranking for weighted tournaments

This page was built for publication: The connection of the acyclic disconnection and feedback arc sets -- on an open problem of Figueroa et al..