Author:
Bachmaier Christian,Fischer Florian,Forster Michael
Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. Bachmaier, C., Brandenburg, F.J., Forster, M.: Radial level planarity testing and embedding in linear time. Journal of Graph Algorithms and Applications (2005), To appear. Preprint under
http://www.infosun.fmi.uni-passau.de/~chris/
2. Brandes, U., Kenis, P., Wagner, D.: Communicating centrality in policy network drawings. IEEE Transact. Vis. Comput. Graph. 9(2), 241–253 (2003)
3. Lecture Notes in Computer Science;U. Brandes,2002
4. Eades, P.: Drawing free trees. Bulletin of the Institute of Combinatorics and its Applications 5, 10–36 (1992)
5. Lecture Notes in Computer Science;P. Eades,1997
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Level-Planarity: Transitivity vs. Even Crossings;The Electronic Journal of Combinatorics;2022-11-04
2. Graph-Matching Based CTA;IEEE Transactions on Medical Imaging;2009-12
3. Radial drawings of graphs: Geometric constraints and trade-offs;Journal of Discrete Algorithms;2008-03
4. Topographic Visualization of Prefix Propagation in the Internet;IEEE Transactions on Visualization and Computer Graphics;2006-09