"Finding a Minimum-depth Embedding of a Planar Graph in ..."

Patrizio Angelini, Giuseppe Di Battista, Maurizio Patrignani (2011)

> Home

Details and statistics

DOI: 10.1007/S00453-009-9380-6

access: closed

type: Journal Article

metadata version: 2017-06-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/AngeliniBP11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/AngeliniBP11
Patrizio Angelini, Giuseppe Di Battista, Maurizio Patrignani:
Finding a Minimum-depth Embedding of a Planar Graph in O(n⁴) Time. Algorithmica 60(4): 890-937 (2011)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.