Linear Time Algorithm to Recognize Clustered Planar Graphs and its Parallelization (Extended Abstract)

Dahlhaus, Elias (1998) Linear Time Algorithm to Recognize Clustered Planar Graphs and its Parallelization (Extended Abstract).
Published In: Theoretical informatics : proceedings / LATIN '98, Third Latin American Symposium, Campinas, Brazil, April 20 - 24, 1998, Lecture notes in computer science. 1380 Springer 1998, pp. 239-248.


Actions:
Full text not available from this repository.
Export as: [error in script]
Editorial actions: View Item View Item (Login required)
Deposit Information:
ZAIK Number: [error in script]
Depositing User: Archive Admin
Date Deposited: 02 Apr 2001 00:00
Last Modified: 17 Oct 2011 13:08
URI: http://e-archive.informatik.uni-koeln.de/id/eprint/325001