Graphic representation of a minute fraction of the WWW, demonstrating hyperlinks.
Graph drawing is an area of mathematics and computer science combining methods from geometric graph theory and information visualization to derive two-dimensional depictions of graphs arising from applications such as social network analysis, cartography, linguistics, and bioinformatics.[1]
A drawing of a graph or network diagram is a pictorial representation of the vertices and edges of a graph. This drawing should not be confused with the graph itself: very different layouts can correspond to the same graph.[2] In the abstract, all that matters is which pairs of vertices are connected by edges. In the concrete, however, the arrangement of these vertices and edges within a drawing affects its understandability, usability, fabrication cost, and aesthetics.[3] The problem gets worse if the graph changes over time by adding and deleting edges (dynamic graph drawing) and the goal is to preserve the user's mental map.[4]
^Di Battista et al. (1998), pp. vii–viii; Herman, Melançon & Marshall (2000), Section 1.1, "Typical Application Areas".
^Di Battista et al. (1998), p. 6.
^Cite error: The named reference dett-viii was invoked but never defined (see the help page).
Graphdrawing is an area of mathematics and computer science combining methods from geometric graph theory and information visualization to derive two-dimensional...
Layered graphdrawing or hierarchical graphdrawing is a type of graphdrawing in which the vertices of a directed graph are drawn in horizontal rows or...
each other. Such a drawing is called a plane graph or planar embedding of the graph. A plane graph can be defined as a planar graph with a mapping from...
mathematical field of graph theory, the Petersen graph is an undirected graph with 10 vertices and 15 edges. It is a small graph that serves as a useful...
century, in the work of Ramon Llull. Such a drawing is sometimes referred to as a mystic rose. The complete graph on n vertices is denoted by Kn. Some sources...
{\displaystyle 2} -manifold. Informally, an embedding of a graph into a surface is a drawing of the graph on the surface in such a way that its edges may intersect...
GraphML is an XML-based file format for graphs. The GraphML file format results from the joint effort of the graphdrawing community to define a common...
properties. Several graphdrawing researchers have investigated algorithms for drawinggraphs in such a way that the automorphisms of the graph become visible...
transitive reduction as an abstract directed acyclic graph, independently of any drawing of that graph, but this usage is eschewed here. Although Hasse diagrams...
hypergraphs, similar to the standard graphdrawing style in which curves in the plane are used to depict graph edges, a hypergraph's vertices are depicted...
on their triangular faces. This graph, and graphs closely related to it, have been frequently used in graphdrawing to prove lower bounds on the area...
Graphviz (short for Graph Visualization Software) is a package of open-source tools initiated by AT&T Labs Research for drawinggraphs (as in nodes and edges...
topological graph is also called a drawing of a graph. An important special class of topological graphs is the class of geometric graphs, where the edges...
as particular labellings or drawings of the graph. While graphdrawing and graph representation are valid topics in graph theory, in order to focus only...
In graph theory, a lattice graph, mesh graph, or grid graph is a graph whose drawing, embedded in some Euclidean space R n {\displaystyle \mathbb {R}...
applications and determines a spectral layout in graphdrawing. Graph-based signal processing is based on the graph Fourier transform that extends the traditional...
term standing for the whole class of technical genres, including graphs, technical drawings and tables. specific kind of visual display: This is only the...
In graph theory, an undirected graph H is called a minor of the graph G if H can be formed from G by deleting edges, vertices and by contracting edges...
Mersenne Twister Coloring algorithm: Graph coloring algorithm. Hopcroft–Karp algorithm: convert a bipartite graph to a maximum cardinality matching Hungarian...
In graphdrawing, a circular layout is a style of drawing that places the vertices of a graph on a circle, often evenly spaced so that they form the vertices...
Global Information