## A parameterized algorithm for upward planarity testing (2004)

### Cached

### Download Links

- [www.cs.uwaterloo.ca]
- [etd.uwaterloo.ca]
- [etd.uwaterloo.ca]
- DBLP

### Other Repositories/Bibliography

Venue: | In Annual European Symposium on Algorithms (Proc. ESA ’04 |

Citations: | 6 - 0 self |

### BibTeX

@INPROCEEDINGS{Chan04aparameterized,

author = {Hubert Yan-chor Chan},

title = {A parameterized algorithm for upward planarity testing},

booktitle = {In Annual European Symposium on Algorithms (Proc. ESA ’04},

year = {2004},

pages = {157--168},

publisher = {Springer-Verlag}

}

### OpenURL

### Abstract

author of this thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners. I understand that my thesis may be made electronically available to the public. ii We can visualize a graph by producing a geometric representation of the graph in which each node is represented by a single point on the plane, and each edge is represented by a curve that connects its two endpoints. Directed graphs are often used to model hierarchical structures; in order to visualize the hierarchy represented by such a graph, it is desirable that a drawing of the graph reflects this hierarchy. This can be achieved by drawing all the edges in the graph such that they all point in an upwards direction. A graph that has a drawing in which all edges point in an upwards direction and in which no edges cross is known as an upward planar graph. Unfortunately, testing if a graph is upward planar is NP-complete. Parameterized complexity is a technique used to find efficient algorithms for hard