International Symposium on Graph Drawing

International Symposium on Graph Drawing

The International Symposium on Graph Drawing (GD) is an annual academic conference in which researchers present papers on graph drawing, information visualization of network information, geometric graph theory, and related topics.


The Graph Drawing symposia have been central to the growth and development of graph drawing as a research area: as Herman et al. write, "the Graph Drawing community grew around the yearly Symposia." [citation|first1=Ivan|last1=Herman|first2=Guy|last2=Melançon|first3=M. Scott|last3=Marshall|title=Graph visualization and navigation in information visualization: A survey|journal=IEEE Transactions in Information Visualization and Computer Graphics|volume=6|issue=1|year=2000|pages=24–43|doi=10.1109/2945.841119.] Nguyen [citation|first=Quang Ving|last=Nguyen|title=Space-Efficient Visualization of Large Hierarchies|series=Ph.D. thesis|publisher=Univ. of Technology, Sydney|year=2005|url=] lists Graph Drawing as one of "several good conferences which directly or indirectly concern with information visualization". In a 2003 study the symposium was among the top 30% of computer science research publication venues, ranked by impact factor. [ [ Estimated impact of publication venues in Computer Science] , CiteSeer, May 2003.]


The first symposium was held in Marino, near Rome, Italy, in 1992, organized by Giuseppe Di Battista, Peter Eades, Pierre Rosenstiehl, and Roberto Tamassia. The first two symposia did not publish proceedings, but reports are available online. [ [ Report from 1992 symposium] and [ 1993 symposium] .] Since 1994, the proceedings of the symposia have been published by Springer-Verlag's Lecture Notes in Computer Science series. [ [ Listing of GD conference proceedings] in DB&LP.]

Countries in which the conference has been held include Australia, Austria, Canada, the Czech Republic, France, Germany (twice), Greece, Ireland, Italy (three times), and the USA (five times).

Citation data and its analysis

A graph having vertices representing the papers in the 1994–2000 Graph Drawing symposia and having edges representing citations between these papers was made available as part of the graph drawing contest associated with the 2001 symposium. [citation|first=T. C.|last=Biedl|first=F. J.|last=Brandenburg|contribution=Graph-drawing contest report|title=Graph Drawing, 9th Int. Symp., GD 2001|volume=2265|series=Lecture Notes in Computer Science|pages=513–522|publisher=Springer-Verlag|year=2002.] The largest connected component of this graph consists of 249 vertices and 642 edges; clustering analysis reveals several prominent subtopics within graph drawing that are more tightly connected, including three-dimensional graph drawing and orthogonal graph drawing. [citation|first1=U.|last1=Brandes|first2=T.|last2=Willhalm|contribution=Visualization of bibliographic networks with a reshaped landscape metaphor|title=Proc. Symp. Data Visualisation 2002|year=2002|publisher=Eurographics Association|pages=159–164|url=]


External links

* [] , the official web site of the conference series.

Wikimedia Foundation. 2010.

Look at other dictionaries:

  • Graph drawing — This article is about the general subject of graph drawing. For the annual research symposium, see International Symposium on Graph Drawing. Graphic representation of a minute fraction of the WWW, demonstrating hyperlinks. Graph drawing is an… …   Wikipedia

  • Crossing number (graph theory) — A drawing of the Heawood graph with three crossings. This is the minimum number of crossings among all drawings of this graph, so the graph has crossing number cr(G) = 3. In graph theory, the crossing number cr(G) of a graph G is the… …   Wikipedia

  • Planar graph — Example graphs Planar Nonplanar Butterfly graph K5 The complete graph K4 …   Wikipedia

  • Outerplanar graph — A maximal outerplanar graph and its 3 coloring. In graph theory, an undirected graph is an outerplanar graph if it can be drawn in the plane without crossings in such a way that all of the vertices belong to the unbounded face of the drawing.… …   Wikipedia

  • Hypergraph — An example hypergraph, with X = {v1,v2,v3,v4,v5,v6,v7} and E = {e1,e2,e3,e4} = {{v1,v2,v3}, {v2,v3} …   Wikipedia

  • Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… …   Wikipedia

  • Force-based algorithms — Force based or force directed algorithms are a class of algorithms for drawing graphs in an aesthetically pleasing way. Their purpose is to position the nodes of a graph in two dimensional or three dimensional space so that all the edges are of… …   Wikipedia

  • David Eppstein — Not to be confused with David Epstein. David Eppstein …   Wikipedia

  • Modular decomposition — In graph theory, the modular decomposition is a decomposition of an undirected graph into subsets of vertices called modules. A module is a generalization of a connected component of a graph. Unlike connected components, however, one module can… …   Wikipedia

  • Planarity testing — In graph theory, the planarity testing problem asks whether, given a graph, that graph is a planar graph (can be drawn in the plane without edge intersections). This is a well studied problem in computer science for which many practical… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.