Computing a feedback arc set using PageRank

DOI10.1007/978-3-031-22203-0_14arXiv2208.09234MaRDI QIDQ6117047

Ioannis. G. Tollis, Panagiotis Lionakis, Vasileios Geladaris

Publication date: 16 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2208.09234

zbMATH Keywords

line graphPageRankfeedback arc sethierarchical graph drawing

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Unnamed Item
• A fast and effective heuristic for the feedback arc set problem
• Reducibility Among Combinatorial Problems
• The NP-completeness column: An ongoing gulde
• A New Framework for Hierarchical Drawings
• Depth-First Search and Linear Graph Algorithms
• Aggregating inconsistent information

This page was built for publication: Computing a feedback arc set using PageRank