Geodesic
Effective Computation of a Feedback Arc Set Using PageRank
Journal of Graph Algorithms and Applications, Special issue on Selected papers from the Thirtieth International Symposium on Graph Drawing and Network Visualization, GD 2022 , Tome 27 (2023) no. 8, pp. 737-757.

Voir la notice de l'article provenant de la source Journal of Graph Algorythms and Applications website

Computing a minimum Feedback Arc Set (FAS) is important for visualizing directed graphs in hierarchical style. It is the first step of both known frameworks for hierarchical graph drawing of directed graphs and it is NP-hard. We present a new heuristic algorithm for computing a minimum FAS in directed graphs. The new technique produces solutions that, for graph drawing datasets, are better than the ones produced by the best previously known heuristics, often reducing the FAS size by more than 50%. The heuristic is based on computing the PageRank score of the nodes of the directed line graph of the input directed graph. Although the time required by our heuristic is heavily influenced by the size of the produced line graph, our experimental results show that it runs very fast even for very large graphs used in graph drawing. We compare results produced by our heuristic to known exact results for specific graphs used in a previous study and discuss the interesting trade-off. Finally, our experimental results on large web-graphs show that our technique found smaller FAS than it was known before for some web-graphs from a data set used in a recent study.
DOI : 10.7155/jgaa.00641
Keywords: Feedback Arc Set, Hierarchical Graph Drawing, Pagerank, Line Graph 
@article{JGAA_2023_27_8_a5,
     author = {Vasileios Geladaris and Panagiotis Lionakis and Ioannis Tollis},
     title = {Effective {Computation} of a {Feedback} {Arc} {Set} {Using} {PageRank}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {737--757},
     publisher = {mathdoc},
     volume = {27},
     number = {8},
     year = {2023},
     doi = {10.7155/jgaa.00641},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00641/}
}
TY  - JOUR
AU  - Vasileios Geladaris
AU  - Panagiotis Lionakis
AU  - Ioannis Tollis
TI  - Effective Computation of a Feedback Arc Set Using PageRank
JO  - Journal of Graph Algorithms and Applications
PY  - 2023
SP  - 737
EP  - 757
VL  - 27
IS  - 8
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00641/
DO  - 10.7155/jgaa.00641
LA  - en
ID  - JGAA_2023_27_8_a5
ER  - 
%0 Journal Article
%A Vasileios Geladaris
%A Panagiotis Lionakis
%A Ioannis Tollis
%T Effective Computation of a Feedback Arc Set Using PageRank
%J Journal of Graph Algorithms and Applications
%D 2023
%P 737-757
%V 27
%N 8
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00641/
%R 10.7155/jgaa.00641
%G en
%F JGAA_2023_27_8_a5
Vasileios Geladaris; Panagiotis Lionakis; Ioannis Tollis. Effective Computation of a Feedback Arc Set Using PageRank. Journal of Graph Algorithms and Applications, 
							Special issue on Selected papers from the Thirtieth International Symposium on Graph Drawing and Network Visualization, GD 2022
					, Tome 27 (2023) no. 8, pp. 737-757. doi : 10.7155/jgaa.00641. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00641/

Cité par Sources :