Research on Minimum Feedback Arc Set Problem
Highlights in Science, Engineering and Technology · 30.03.2025 · 134 · 269-284
DOI: 10.54097/az8w1s78 ↗Kurz gefasst
Fachartikel in der Zeitschrift Highlights in Science, Engineering and Technology, online erschienen am 30.03.2025. Verfasst von Houyu Lin. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 15 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC 4.0).
Abstract (Originalsprache)
The feedback arc set of a directed graph is the subset of the graph that consists of at least one edge from every cycle in the graph. Removing the fewest number of these edges gives the minimum feedback arc set. Three methods that attempt to solve this problem use equivalency and NP reductions, an approximate greedy algorithm, and an integer linear program for an exact solution. The minimum FAS can be applied to real world events such as sporting tournaments and ranked voting.
Zitieren
APA
Lin, H. (2025). Research on Minimum Feedback Arc Set Problem. Highlights in Science, Engineering and Technology, 134, 269-284. https://doi.org/10.54097/az8w1s78
Vancouver
Lin H. Research on Minimum Feedback Arc Set Problem. Highlights in Science, Engineering and Technology. 2025;134:269-284. doi:10.54097/az8w1s78
BibTeX
@article{Lin2025,
author = {Lin, Houyu},
title = {Research on Minimum Feedback Arc Set Problem},
journal = {Highlights in Science, Engineering and Technology},
year = {2025},
volume = {134},
pages = {269--284},
doi = {10.54097/az8w1s78}
}
EUVIMED