Effective Computation of a Feedback Arc Set Using PageRank
From MaRDI portal
Publication:6181948
DOI10.7155/jgaa.00641OpenAlexW4388429631MaRDI QIDQ6181948
Vasileios Geladaris, Panagiotis Lionakis, Ioannis. G. Tollis
Publication date: 20 December 2023
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00641
Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A fast and effective heuristic for the feedback arc set problem
- The NP-completeness column: An ongoing gulde
- Sorting, Minimal Feedback Sets, and Hamilton Paths in Tournaments
- Reducibility among Combinatorial Problems
- An Exact Method for the Minimum Feedback Arc Set Problem
- A New Framework for Hierarchical Drawings
- Depth-First Search and Linear Graph Algorithms
- Aggregating inconsistent information
This page was built for publication: Effective Computation of a Feedback Arc Set Using PageRank
