38 citations · 50 across the 13 of their papers we have counts for
4 papers · 1 filter
Fast and Practical DAG Decomposition with Reachability Applications
Giorgos Kritikakis, Ioannis G. Tollis
We present practical linear and almost linear-time algorithms to compute a chain decomposition of a directed acyclic graph (DAG), . The number of vertex-disjoint chains co…
Experiments and a User Study for Hierarchical Drawings of Graphs
Panagiotis Lionakis, Giorgos Kritikakis, Ioannis G. Tollis
We present experimental results and a user study for hierarchical drawings of graphs. A detailed hierarchical graph drawing technique that is based on the Path Based Framework (PBF…
Computing a Feedback Arc Set Using PageRank
Vasileios Geladaris, Panagiotis Lionakis, Ioannis G. Tollis
We present a new heuristic algorithm for computing a minimum Feedback Arc Set in directed graphs. The new technique produces solutions that are better than the ones produced by the…
Computing Weak Dominance Drawings with Minimum Number of Fips
Giacomo Ortali, Ioannis G. Tollis
A weak dominance drawing of a DAG , is a -dimensional drawing such that there is a directed path from a vertex to a vertex in if for every…