@inproceedings{e5baa9ac1c4848b9bd66f40235970404,
title = "A fully dynamic algorithm to test the upward planarity of single-source embedded digraphs",
abstract = "In this paper, we present a dynamic algorithm that checks if a single-source embedded digraph is upward planar in the presence of edge insertions and edge deletions. Let G {\O}φ be an upward planar single-source embedded digraph and let G?{\O}φ? {\O} be a single-source embedded digraph obtained by updating G {\O}φ. We show that the upward planarity of G? {\O}φ?can be checked in O(logn) amortized time when the external face is fixed.",
author = "Aimal Rextin and Patrick Healy",
year = "2009",
doi = "10.1007/978-3-642-00219-9_24",
language = "English",
isbn = "3642002188",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "254--265",
booktitle = "Graph Drawing - 16th International Symposium, GD 2008, Revised Papers",
note = "16th International Symposium on Graph Drawing, GD 2008 ; Conference date: 21-09-2008 Through 24-09-2008",
}