Dahlhaus, E.: A Linear Time Algorithm to Recognize Clustered Planar Graphs and Its Parallelization. In: Lucchesi, C.,L. (ed.): 3rd Latin American Symposium on Theoretical Informatics, LATIN '98. LNCS, Vol. 1380. Springer (1998) 239--248 Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Clustered Level Planarity - Forster, Bachmaier (2004) (Correct)
No context found.
Dahlhaus, E.: A Linear Time Algorithm to Recognize Clustered Planar Graphs and Its Parallelization. In: Lucchesi, C.,L. (ed.): 3rd Latin American Symposium on Theoretical Informatics, LATIN '98. LNCS, Vol. 1380. Springer (1998) 239--248
Completely Connected Clustered Graphs - Cornelsen, Wagner (2003) (Correct)
No context found.
E. Dahlhaus. A linear time algorithm to recognize clustered planar graphs and its parallelization. In C. L. Lucchesi and A. V. Moura, editors, Proceedings of the 3rd Latin American Symposium on Theoretical Informatics (LATIN '98), volume 1380 of Lecture Notes in Computer Science, pages 239-248. Springer, 1998.
Clustered Level Planarity - Forster, Bachmaier (Correct)
No context found.
E. Dahlhaus. A linear time algorithm to recognize clustered planar graphs and its parallelization. In C. L. Lucchesi, editor, 3rd Latin American Symposium on Theoretical Informatics, LATIN '98, volume 1380 of LNCS, pages 239--248. Springer, 1998.
Papers and Technical Reports - Zpr/zaik (1998) (Correct)
No context found.
Dahlhaus, E. Linear Time Algorithm to Recognize Clustered Planar Graphs and its Parallelization. Tech. rep., Informatik, Universit at zu K oln, 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC