Fixed-Parameter Tractable Algorithms for Testing Upward Planarity-Reference-Cited by-同舟云学术

Fixed-Parameter Tractable Algorithms for Testing Upward Planarity

Published:2005 Issue: Volume: Page:199-208
ISSN:0302-9743
Container-title:SOFSEM 2005: Theory and Practice of Computer Science
language:
Short-container-title:

Author:

Healy Patrick,Lynch Karol

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-30577-4_23.pdf

Reference18 articles.

1. Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Englewood Cliffs (1999)

2. Garg, A., Tamassia, R.: On the computational complexity of upward and rectilinear planarity testing. SIAM Journal Comput. 31, 601–625 (2001)

3. Lecture Notes in Computer Science;G.D. Battista,1999

4. Bertolazzi, P., Battista, G.D., Liotta, G., Mannino, C.: Upward drawings of triconnected digraphs. Algorithmica 6, 476–497 (1994)

5. Bertolazzi, P., Battista, G.D., Mannino, C., Tamassia, R.: Optimal upward planarity testing of single-source digraphs. SIAM Journal on Computing 27, 132–169 (1998)

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Upward Planarity Testing in Practice;ACM Journal of Experimental Algorithmics;2015-12-15

2. Upward Planarity Testing via SAT;Graph Drawing;2013

3. Upward Planarity Testing: A Computational Study;Graph Drawing;2013

4. Improving the running time of embedded upward planarity testing;Information Processing Letters;2010-03

5. An Improved Upward Planarity Testing Algorithm and Related Applications;WALCOM: Algorithms and Computation;2009