Upper Bounds on the Number of Hidden Nodes in Sugiyama's Algorithm

Frick, Arne (1997) Upper Bounds on the Number of Hidden Nodes in Sugiyama's Algorithm. In: Symposium on Graph Drawing, GD '96, September 18-20, 1996 , pp. 169-183(Official URL: http://dx.doi.org/10.1007/3-540-62495-3_46).

Full text not available from this repository.


This paper analyzes the exact and asymptotic worst-case complexity of the simplification phase of Sugiyama's algorithm for drawing arbitrary directed graphs. The complexity of this phase is determinatedby the number of hidden nodes inserted. The best previously known upper bound for this number is O(max{|V|³, |E|²}). This paper establishes a relation between both partial results and gives upper bounds for many classes of graphs. This is archived by constructing a worst-case example for every legal configuration C=(h,n,m) of the input hierarchy for the simplification phase. These results provide further insight into the worst-case runtime and space complexity of Sugiyama's algorithm. Possible applications include their use as feasibility criteria, based on simpy derived quantitative information on the graph.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-62495-3_46
Classifications: M Methods > M.500 Layered
G Algorithms and Complexity > G.999 Others
P Styles > P.480 Layered
URI: http://gdea.informatik.uni-koeln.de/id/eprint/116

Actions (login required)

View Item View Item