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. 239248.
Actions:
Content information:
Item Type:  Proceedings article 

Citations:  [error in script] [error in script] 
Subjects: 

Subjects:  68XX Computer science > 68Qxx Theory of computing > 68Q25 Analysis of algorithms and problem complexity 68XX Computer science > 68Rxx Discrete mathematics in relation to computer science > 68R10 Graph theory 68XX Computer science > 68Wxx Algorithms > 68W10 Parallel algorithms 68XX Computer science > 68Wxx Algorithms > 68W35 VLSI algorithms 
Divisions:  Institute of Computer Science 
Depositing User:  Archive Admin 
Date Deposited:  02 Apr 2001 00:00 
Last Modified:  17 Oct 2011 13:08 
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://earchive.informatik.unikoeln.de/id/eprint/325001 