A Generalization of the Directed Graph Layering Problem-Reference-Cited by-同舟云学术

A Generalization of the Directed Graph Layering Problem

Published:2016 Issue: Volume: Page:196-208
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Rüegg Ulf,Ehlers Thorsten,Spönemann Miro,von Hanxleden Reinhard

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-50106-2_16

Reference20 articles.

1. Lecture Notes in Computer Science;U Brandes,2002

2. Lecture Notes in Computer Science;C Buchheim,2001

3. Lecture Notes in Computer Science;G Battista,1997

4. Dwyer, T., Koren, Y.: DIG-COLA: directed graph layout through constrained energy minimization. In: Proceedings of the IEEE Symposium on Information Visualization (INFOVIS 2005), pp. 65–72, October 2005

5. Eades, P., Lin, X., Smyth, W.F.: A fast and effective heuristic for the feedback arc set problem. Inf. Process. Lett. 47(6), 319–323 (1993)

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

1. Evaluating Graph Layout Algorithms: A Systematic Review of Methods and Best Practices;Computer Graphics Forum;2024-05-03

2. STRATISFIMAL LAYOUT: A modular optimization model for laying out layered node-link network visualizations;IEEE Transactions on Visualization and Computer Graphics;2022-01

3. A Natural Quadratic Approach to the Generalized Graph Layering Problem;Lecture Notes in Computer Science;2019

4. On Multitree-Like Graph Layering;Studies in Computational Intelligence;2017-11-27

5. A Visualization Framework and User Studies for Overloaded Orthogonal Drawings;Computer Graphics Forum;2017-09-01