Finding a minimum-depth embedding of a planar graph in \(O(n^{4})\) time
type: Item
instance of: scholarly article
title: Finding a minimum-depth embedding of a planar graph in \(O(n^{4})\) time
zbMATH Open document ID: 1217.05064
author: Patrizio Angelini
author: Giuseppe Di Battista
author: Maurizio Patrignani
published in: Algorithmica
publication date: 2011-07-01T00:00:00Z
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C60
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 5916750
zbMATH Keywords: planar embedding
zbMATH Keywords: minimum depth
zbMATH Keywords: planar graph
zbMATH Keywords: triconnected components
MaRDI profile type: Publication
full work available at URL: s00453-009-9380-6
OpenAlex ID: W2082479932
cites work: Approximation algorithms for NP-complete problems on planar graphs
cites work: On the Complexity of Covering Vertices by Faces in a Planar Graph
cites work: On the complexity of embedding planar graphs to minimize certain distance measures
cites work: On-Line Planarity Testing
cites work: Computing Radial Drawings on the Minimum Number of Circles
cites work: Determining the Smallest k Such That G Is k-Outerplanar
cites work: Graph Drawing
cites work: Q2753952
cites work: Graph minors. III. Planar tree-width
cites work: Undirected single-source shortest paths with positive integer weights in linear time
DOI: 10.1007/S00453-009-9380-6
description: scientific article; zbMATH DE number 5916750