Finding small feedback arc sets on large graphs

DOI10.1016/J.COR.2024.106724MaRDI QIDQ6979425zbMATH OpenFDO

Authors Ziliang Xiong, Yi Zhou, Mingyu Xiao, Bakhadyr Khoussainov

Publication date 26 May 2025

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.COR.2024.106724

zbMATH Keywords

graph algorithmsreduction rulesfeedback arc sets

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• scientific article; zbMATH DE number 432770 (Why is no real title available?)
• scientific article; zbMATH DE number 5485441 (Why is no real title available?)
• scientific article; zbMATH DE number 5485529 (Why is no real title available?)
• scientific article; zbMATH DE number 825126 (Why is no real title available?)
• A fast and effective algorithm for the feedback arc set problem
• A fast and effective heuristic for the feedback arc set problem
• A new heuristic algorithm solving the linear ordering problem
• Aggregating inconsistent information
• An exact method for the minimum feedback arc set problem
• Block-insertion-based algorithms for the linear ordering problem
• Deadlock resolution in wait-for graphs by vertex/arc deletion
• Depth-First Search and Linear Graph Algorithms
• Exact exponential algorithms.
• Exact localisations of feedback sets
• On the hardness of approximating minimum vertex cover
• Ranking tournaments: local search and a new algorithm
• Reducibility among combinatorial problems
• Simple proof of hardness of feedback vertex set
• Tight localizations of feedback sets

Cited in

(1)

• Minimal and stable feedback arc sets and graph centrality measures

This page was built for publication: Finding small feedback arc sets on large graphs

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