Finding a Minimum-depth Embedding of a Planar Graph inO(n4)...

Algorithmica 2011 / 08 Vol. 60; Iss. 4

Finding a Minimum-depth Embedding of a Planar Graph inO(n4) Time

Patrizio Angelini, Giuseppe Di Battista, Maurizio Patrignani
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
60
Language:
english
Pages:
48
DOI:
10.1007/s00453-009-9380-6
Date:
August, 2011
File:
PDF, 1.70 MB
english, 2011
Conversion to is in progress
Conversion to is failed