Drawing graphs with GLEE

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4875 LNCS, Issue , 2008, Pages 389-394

  Nachmanson, Lev ^a   Robertson, George ^a   Lee, Bongshin ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASPECT RATIO; DRAWING (GRAPHICS); HEURISTIC ALGORITHMS; HEURISTIC METHODS; HEURISTIC PROGRAMMING; ROUTING ALGORITHMS;

EFFICIENT METHODS; GRAPH DRAWING; GRAPH LAYOUT; INTERNATIONAL SYMPOSIUM; LAY-OUT; NOVEL METHODS;

GRAPH THEORY;

EID: 49949114969     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77537-9_38     Document Type: Conference Paper

References (16)

1. Drawing graphs with GLEE technical report, Lev Nachmanson. George Robertson and Bongshin Lee, ftp://ftp.research.microsoft.com/pub/tr/TR-2007-72. pdf
2. Graphviz todo list (December 22, 2005), http ://www.graphviz.org/doc/ todo.html
3. Abello, J., Gansner, E.R.: Short and smooth polygonal paths. In: Lucchesi, C.L., Moura, A.V. (eds.) LATIN 1998. LNCS, vol. 1380, pp. 151-162. Springer, Heidelberg (1998)
4. Barth, W., Jünger, M.. Mutzel, P.: Simple and efficient bilayer cross counting. In: Goodrich. M.T., Kobourov. S.G. (eds.) GD 2002. LNCS, vol. 2528, pp. 130-141. Springer, Heidelberg (2002)
5. Brandes, U.. Köpf, B.: Fast and simple horizontal coordinate assignment. In: Mutzel, P., Jünger, M., Leipert. S. (eds.) GD 2001. LNCS, vol. 2265, pp. 31-44. Springer, Heidelberg (2002)
6. Coffman. E.G., Graham, R.L.: Optimal Scheduling for Two-Processor Systems. Acta Informatica 1(3), 200-213 (1972)
7. Dobkin, D.P.. Gansner, E.R.. Koutsofios, E., North, S.: Implementing a general-purpose edge router. In: Di Battista. G. (ed.) Graph Drawing, Rome, Italy. September 18-20, 1997, pp. 262-271. Springer, Heidelberg (1998)
8. Eiglsperger, M., Siebenhaller, M.. Kaufmann, M.: An efficient implementation of sugiyama's algorithm for layered graph drawing. In: Pach, J. (ed.) Graph Drawing. New York, pp. 155-166. Springer, Heidelberg (2004)
9. Gansner. E.R., Koutsofios, E., North, S.C., Vo, K.-R: A Technique for Drawing Directed Graphs. IEEE Transactions on Software Engineering 19(3), 214-230 (1993)
10. Goodrich. M.T., Kobourov. S.G. (eds.): GD 2002. LNCS, vol. 2528. Springer, Heidelberg (2002)
11. Healy, P., Nikolov, N.S.: A branch-and-cut approach to the directed acyclic graph layering problem. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol. 2528, pp. 98-109. Springer, Heidelberg (2002)
12. Lutterkort, D., Peters, J.: Smooth paths in a polygonal channel. In: Symposium on Computational Geometry, pp. 316-321 (1999)
13. Myles, A.. Peters, J.: Threading splines through 3d channels. Computer-Aided Design 37(2), 139-148 (2005)
14. Nikolov, N.S.. Tarassov, A.: Graph layering by promotion of nodes. Discrete Applied Mathematics 154(5). 848-860 (2006)
15. Nikolov. N.S., Tarassov, A., Branke, J.: In search for efficient heuristics for minimum-width graph layering with consideration of dummy nodes. J. Exp. Algorithmics 10(2.7) (2005)
16. Sugiyama, K., Tagawa, S.. Toda, M.: Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man and Cybernetics SMC-11(2), 109-125 (1981)