Effective Computation of a Feedback Arc Set Using PageRank

DOI10.7155/JGAA.00641MaRDI QIDQ6181948zbMATH OpenOpenAlexFDO

Authors 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)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.7155/jgaa.00641

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Computing a feedback arc set using PageRank
• An Arnoldi-Inout algorithm for computing PageRank problems
• On efficient randomized algorithms for finding the PageRank vector
• Arnoldi-RPIO algorithm for computing PageRank problems
• An Arnoldi-extrapolation algorithm for computing pagerank

Cites work

• A fast and effective heuristic for the feedback arc set problem
• A new framework for hierarchical drawings
• Aggregating inconsistent information: ranking and clustering
• An exact method for the minimum feedback arc set problem
• Depth-First Search and Linear Graph Algorithms
• scientific article; zbMATH DE number 432770 (Why is no real title available?)
• scientific article; zbMATH DE number 2123123 (Why is no real title available?)
• scientific article; zbMATH DE number 50596 (Why is no real title available?)
• Reducibility among combinatorial problems
• Sorting, Minimal Feedback Sets, and Hamilton Paths in Tournaments
• The NP-completeness column: An ongoing gulde

This page was built for publication: Effective Computation of a Feedback Arc Set Using PageRank

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