Upward Spirality and Upward Planarity Testing

2010 ◽  
Vol 23 (4) ◽  
pp. 1842-1899 ◽  
Author(s):  
Walter Didimo ◽  
Francesco Giordano ◽  
Giuseppe Liotta
Keyword(s):  
Author(s):  
Paola Bertolazzi ◽  
Giuseppe Di Battista ◽  
Walter Didimo
Keyword(s):  

2006 ◽  
Vol 17 (05) ◽  
pp. 1095-1114 ◽  
Author(s):  
PATRICK HEALY ◽  
KAROL LYNCH

In this paper we consider the problem of testing an arbitrary digraph G = (V,E) for upward planarity. In particular we describe two fixed-parameter tractable algorithms for testing the upward planarity of G. The first algorithm that we present can test the upward planarity of G in O(2t · t! · |V|2)-time where t is the number of triconnected components of G. The second algorithm that we present uses a standard technique known as kernelisation and can test the upward planarity of G in O(|V|2 + k4 · (2k)!)-time, where k = |E| - |V|.


Author(s):  
Christopher Auer ◽  
Christian Bachmaier ◽  
Franz J. Brandenburg ◽  
Kathrin Hanauer

1998 ◽  
Vol 27 (1) ◽  
pp. 132-169 ◽  
Author(s):  
Paola Bertolazzi ◽  
Giuseppe Di Battista ◽  
Carlo Mannino ◽  
Roberto Tamassia

2014 ◽  
Vol 526 ◽  
pp. 75-89 ◽  
Author(s):  
Carla Binucci ◽  
Walter Didimo ◽  
Maurizio Patrignani

Author(s):  
Paola Bertolazzi ◽  
Giuseppe Di Battista ◽  
Carlo Mannino ◽  
Roberto Tamassia

Sign in / Sign up

Export Citation Format

Share Document