Finding a Minimum-depth Embedding of a Planar Graph in ::::O::::(::::n:::::::4:::) Time

Patrizio Angelini, Giuseppe Di Battista, Maurizio Patrignani. Finding a Minimum-depth Embedding of a Planar Graph in ::::O::::(::::n:::::::4:::) Time. Algorithmica, 60(4):890-937, 2011. [doi]

Abstract

Abstract is missing.