Finding a minimum-depth embedding of a planar graph in \(O(n^{4})\) time
scientific article; zbMATH DE number 5916750