3 papers
cs.DS2022
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…
cs.HC2022
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…
cs.DS2020
Algorithms and Experiments Comparing Two Hierarchical Drawing Frameworks
Panagiotis Lionakis, Giorgos Kritikakis, Ioannis G. Tollis
We present algorithms that extend the path-based hierarchical drawing framework and give experimental results. Our algorithms run in time, where is the number of paths…