Skip to main content
Conference ProceedingsOPEN ACCESS

Upward spirality and upward planarity testing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2006) 3843 LNCS 117-128
DOI: 10.1007/11618058_12
8Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The upward planarity testing problem is known to be NP-hard. We describe an O(n4)-time upward planarity testing and embedding algorithm for the class of digraphs that do not contain rigid triconnected components. We also present a new FPT algorithm that solves the upward planarity testing and embedding problem for general digraphs. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Didimo, W., Giordano, F., & Liotta, G. (2006). Upward spirality and upward planarity testing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3843 LNCS, pp. 117–128). https://doi.org/10.1007/11618058_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free