Skip to main content
Conference ProceedingsOPEN ACCESS

Drawing graphs with GLEE

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2008) 4875 LNCS 389-394
DOI: 10.1007/978-3-540-77537-9_38
14Citations
Citations of this article
23Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper describes novel methods we developed to lay out graphs using Sugiyama's scheme [16] in a tool named GLEE. The main contributions are: a heuristic for creating a graph layout with a given aspect ratio, an efficient method of edge-crossings counting while performing adjacent vertex swaps, and a simple and fast spline routing algorithm. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Nachmanson, L., Robertson, G., & Lee, B. (2008). Drawing graphs with GLEE. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4875 LNCS, pp. 389–394). https://doi.org/10.1007/978-3-540-77537-9_38

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free