eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2020-06-12
24:1
24:14
10.4230/LIPIcs.SWAT.2020.24
article
Simplifying Activity-On-Edge Graphs
Eppstein, David
1
Frishberg, Daniel
1
https://orcid.org/0000-0002-1861-5439
Havvaei, Elham
1
https://orcid.org/0000-0003-0069-2863
University of California, Irvine, CA, United States
We formalize the simplification of activity-on-edge graphs used for visualizing project schedules, where the vertices of the graphs represent project milestones, and the edges represent either tasks of the project or timing constraints between milestones. In this framework, a timeline of the project can be constructed as a leveled drawing of the graph, where the levels of the vertices represent the time at which each milestone is scheduled to happen. We focus on the following problem: given an activity-on-edge graph representing a project, find an equivalent activity-on-edge graph—one with the same critical paths—that has the minimum possible number of milestone vertices among all equivalent activity-on-edge graphs. We provide an O(mn²)-time algorithm for solving this graph minimization problem.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol162-swat2020/LIPIcs.SWAT.2020.24/LIPIcs.SWAT.2020.24.pdf
directed acyclic graph
activity-on-edge graph
critical path
project planning
milestone minimization
graph visualization