Log in

Relevant bibliographies by topics / Graph drawing

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Graph drawing'

Author: Grafiati

Published: 4 June 2021

Last updated: 11 June 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Graph drawing.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Graph drawing"

1

EADES, PETER, XUEMIN LIN, and ROBERTO TAMASSIA. "AN ALGORITHM FOR DRAWING A HIERARCHICAL GRAPH." International Journal of Computational Geometry & Applications 06, no. 02 (1996): 145–55. http://dx.doi.org/10.1142/s0218195996000101.

Full text

Abstract:

Hierarchical graphs appear in several graph drawing applications, where nodes are assigned layers for semantic reasons. More importantly, general methods for drawing directed graphs usually begin by transforming the input digraph into a hierarchical graph, then applying a hierarchical graph drawing algorithm. This paper introduces the Degree Weighted Barycentre (DWB) algorithm for drawing hierarchical graphs. We show that drawings output by DWB satisfy several important aesthetic criteria: under certain connectivity conditions, they are planar, convex, and symmetric whenever such drawings are possible. The algorithm can be implemented as a simple Gauss — Seidel iteration.

APA, Harvard, Vancouver, ISO, and other styles

2

BRIDGEMAN, STINA, ASHIM GARG, and ROBERTO TAMASSIA. "A GRAPH DRAWING AND TRANSLATION SERVICE ON THE WORLD WIDE WEB." International Journal of Computational Geometry & Applications 09, no. 04n05 (1999): 419–46. http://dx.doi.org/10.1142/s021819599900025x.

Full text

Abstract:

Both practitioners and researchers can take better advantage of the latest developments in graph drawing if implementations of graph drawing algorithms are made available on the WWW. We envision a graph drawing and translation service for the WWW with dual objectives: drawing user-specified graphs, and translating graph-descriptions and graph drawings from one format to another. As a first step toward realizing this vision, we have developed a prototype service which is available at .

APA, Harvard, Vancouver, ISO, and other styles

3

Iqbal Hossain, Md, and Md Saidur Rahman. "Straight-line monotone grid drawings of series–parallel graphs." Discrete Mathematics, Algorithms and Applications 07, no. 02 (2015): 1550007. http://dx.doi.org/10.1142/s179383091550007x.

Full text

Abstract:

A monotone drawing of a planar graph G is a planar straight-line drawing of G where a monotone path exists between every pair of vertices of G in some direction. Recently monotone drawings of graphs have been discovered as a new standard for visualizing graphs. In this paper we study monotone drawings of series–parallel graphs in a variable embedding setting. We show that a series–parallel graph of n vertices has a straight-line planar monotone drawing on a grid of size O(n) × O(n2) and such a drawing can be found in linear time.

APA, Harvard, Vancouver, ISO, and other styles

4

Kang, Ming-Hsuan, and Jing-Wen Gu. "Toroidal Spectral Drawing." Axioms 11, no. 3 (2022): 137. http://dx.doi.org/10.3390/axioms11030137.

Full text

Abstract:

We give a deterministic drawing algorithm to draw a graph onto a torus, which is based on the usual spectral drawing algorithm. For most of the well-known toroidal vertex-transitive graphs, the result drawings give an embedding of the graphs onto the torus.

APA, Harvard, Vancouver, ISO, and other styles

5

BIEDL, THERESE C., BRENDAN P. MADDEN, and IOANNIS G. TOLLIS. "THE THREE-PHASE METHOD: A UNIFIED APPROACH TO ORTHOGONAL GRAPH DRAWING." International Journal of Computational Geometry & Applications 10, no. 06 (2000): 553–80. http://dx.doi.org/10.1142/s0218195900000310.

Full text

Abstract:

In this paper, we study orthogonal graph drawings from a practical point of view. Most previously existing algorithms restricted the attention to graphs of maximum degree four. Here we study orthogonal drawing algorithms that work for any input graph, and discuss different models for such drawings. Then we introduce the three-phase method, a generic technique to create high-degree orthogonal drawings. This approach simplifies the description and implementation of orthogonal graph drawing, and can be applied to global as well as interactive and incremental settings.

APA, Harvard, Vancouver, ISO, and other styles

6

Bertolazzi, P., G. Di Battista, and G. Liotta. "Parametric graph drawing." IEEE Transactions on Software Engineering 21, no. 8 (1995): 662–73. http://dx.doi.org/10.1109/32.403790.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

DEHKORDI, HOOMAN REISI, and PETER EADES. "EVERY OUTER-1-PLANE GRAPH HAS A RIGHT ANGLE CROSSING DRAWING." International Journal of Computational Geometry & Applications 22, no. 06 (2012): 543–57. http://dx.doi.org/10.1142/s021819591250015x.

Full text

Abstract:

There is strong empirical evidence that human perception of a graph drawing is negatively correlated with the number of edge crossings. However, recent experiments show that one can reduce the negative effect by ensuring that the edges that cross do so at large angles. These experiments have motivated a number of mathematical and algorithmic studies of “right angle crossing (RAC)” drawings of graphs, where the edges cross each other perpendicularly. In this paper we give an algorithm for constructing RAC drawings of “outer-1-plane” graphs, that is, topological graphs in which each vertex appears on the outer face, and each edge crosses at most one other edge. The drawing algorithm preserves the embedding of the input graph. This is one of the few algorithms available to construct RAC drawings.

APA, Harvard, Vancouver, ISO, and other styles

8

MIURA, KAZUYUKI, SHIN-ICHI NAKANO, and TAKAO NISHIZEKI. "CONVEX GRID DRAWINGS OF FOUR-CONNECTED PLANE GRAPHS." International Journal of Foundations of Computer Science 17, no. 05 (2006): 1031–60. http://dx.doi.org/10.1142/s012905410600425x.

Full text

Abstract:

A convex grid drawing of a plane graph G is a drawing of G on the plane such that all vertices of G are put on grid points, all edges are drawn as straight-line segments without any edge-intersection, and every face boundary is a convex polygon. In this paper we give a linear-time algorithm for finding a convex grid drawing of every 4-connected plane graph G with four or more vertices on the outer face. The size of the drawing satisfies W + H ≤ n - 1, where n is the number of vertices of G, W is the width and H is the height of the grid drawing. Thus the area W · H is at most ⌈(n - 1)/2⌉ · ⌊(n - 1)/2⌋. Our bounds on the sizes are optimal in a sense that there exist an infinite number of 4-connected plane graphs whose convex drawings need grids such that W + H = n - 1 and W · H = ⌈(n - 1)/2⌉ · ⌊(n - 1)/2⌋.

APA, Harvard, Vancouver, ISO, and other styles

9

Liotta, Giuseppe, and Henk Meijer. "Advances in graph drawing: The 11th International Symposium on Graph Drawing." Discrete Applied Mathematics 155, no. 9 (2007): 1077. http://dx.doi.org/10.1016/j.dam.2006.10.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

A. Antony mary, A., A. Amutha, and M. S. Franklin Thamil Selvi. "A Study on Slope Number of Certain Classes of Bipartite Graphs." International Journal of Engineering & Technology 7, no. 4.10 (2018): 440. http://dx.doi.org/10.14419/ijet.v7i4.10.21036.

Full text

Abstract:

Graph drawing is the most important area of mathematics and computer science which combines methods from geometric graph theory and information visualization. Generally, graphs are represented to explore some intellectual ideas. Graph drawing is the familiar concept of graph theory. It has many quality measures and one among them is the slope number. Slope number problem is an optimization problem and is NP-hard to determine the slope number of any arbitrary graph. In the present paper, the investigation on slope number of bipartite graph is studied elaborately. Since the bipartite graphs creates one of the most intensively investigated classes of graphs, we consider few classes of graphs and discussed structural behavior of such graphs.

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Graph drawing"

1

Suderman, Matthew. "Layered graph drawing." Thesis, McGill University, 2005. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=86054.

Full text

Abstract:

A layered graph drawing is a two-dimensional drawing of a combinatorial graph in which the vertices lie on a given set of horizontal lines. Such drawings are used in application domains such as software engineering, bioinformatics, and VLSI design. In addition to being layered, drawings in these applications may also satisfy other constraints, for example bounds on the number of edge crossings. The problems related to obtaining these drawings are almost always NP -hard, so, in this thesis, we investigate restricted versions of these problems in order to find efficient algorithmic solutions that can be used in practice.<br>As a first very drastic restriction, we consider layered drawings that are planar. Even with this restriction, however, the resulting problems can still be NP -hard. In addition to proving one such hardness result, we do succeed in deriving efficient algorithms for two problems. In both cases, we correct previously published results that claimed extremely simple and efficient algorithmic solutions to these problems. Our solutions, though efficient as well, show that the truth about these problems is significantly more complex than the published results would suggest.<br>We also study non-planar layered drawings, particularly drawings obtained by crossing minimization and minimum planarization. Though the corresponding problems are NP -hard, they become tractable when the value to be minimized is upper-bounded by a constant. This approach to obtaining tractable problems is formalized in a theory called parameterized complexity, and the resulting tractable problems and algorithmic solutions are said to be fixed-parameter tractable ( FPT ). Though relatively new, this theory has attracted a rapidly growing body of theoretical results. Indeed, we derive original FPT algorithms with the best-known asymptotic running times for planarization in two layer drawings.<br>Because parameterized complexity is so new, little is known about its implications to the practice of graph drawing. Consequently, we have implemented a few FPT algorithms and compared them experimentally with previously implemented approaches, especially integer linear programming (ILP). Our experiments show that the performance of our FPT planarization algorithms are competitive with current ILP algorithms, but that, for crossing minimization, current ILP algorithms remain the clear winners.

APA, Harvard, Vancouver, ISO, and other styles

2

Puppe, Thomas. "Spectral graph drawing." [S.l. : s.n.], 2005. http://www.bsz-bw.de/cgi-bin/xvms.cgi?SWB11759114.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Schulz, Michael. "Simultaneous graph drawing." Tönning Marburg Lübeck Der Andere Verl, 2008. http://d-nb.info/992494834/04.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Aspegren, Villiam. "CluStic – Automatic graph drawing with clusters." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-179251.

Full text

Abstract:

Finding a visually pleasing layout from a set of vertices and edges is the goal of automatic graph drawing. A requirement that has been barely explored however, is that users would like to specify portions of their layouts that are not altered by such algorithms. For example the user may have put a lot of manual effort into fixing a portion of a large layout and, while they would like an automatic layout applied to most of the layout, they do not want their work undone on the portion they manually fixed earlier. CluStic, the system developed and evaluated in this thesis, provides this capability. CluStic maintain the internal structure of a cluster by giving it priority over other elements in the graph. After high priority element has been positioned, non-priority vertices may be placed at the most appropriate remaining positions. Furthermore CluStic produces layouts which also maintain common aesthetic criteria: edge crossing minimization, layout height and edge straightening. Our method in this thesis is to first conduct an initial exploration study where we cross compare four industrial tools: Cytogate, GraphDraw, Diagram.Net and GraphNet. A set of layouts are generated with these tools and the user is timed on a task to identify the longest path. Through this exploration study we develop out intuition and determined that Cytogate is the best performing tool for longest path identification. Given this experience we fully develop CluStic and conduct our main study where we cross compare it with Cytogate and a baseline Breadth-first Search algorithm. Results show that CluStic produces drawings of good quality, Clustic achieves a visualization efficiency score of 1,4 which is an increase compared to the BFS layout (-3,8). CluStic is outperformed by Cytogate which achieves a visualization efficiency score of 1,9 and therefore produces less visually pleasing drawings. However Clustic, unlike Cytogate can preserve initial static structures, thus when a graph contains elements in which their position cannot be altered CluStic is a better choice.<br>Målet med automatiserad grafritning är att utifrån en uppsättning noder och kanter hitta en layout som är visuellt tillfredställande. Ett delområde som inte utforskats nog är möjligheten till att låsa vissa komponenter i grafen som sedan inte får alterneras av grafritningsalgoritmen. En användare som exempel, strukturerar vissa delar av grafen manuellt och applicerar sedan automatisk layout av resterande element utan att förstöra den struktur som manuellt skapats. CluStic, grafritningsverktyget som skapats och utvärderats i denna masters uppsats fyller denna funktion. CluStic bevarar den interna strukturen för ett kluster genom att tilldela en högre prioritet för noder i klustret med avseende på övriga element i grafen. Efter att högprioritets element placerats tilldelas resterande element sina bäst tillgängliga positioner. Utöver detta så uppfyller CluStic några av de vanligaste estetiska mål inom grafritning: minimera antalet kantkorsningar, minimera höjden, och räta ut kanter. Metoden som används i denna master uppsatts var att först gör en inledande studie där vi undersöker fyra populära grafritnings verktyg: Cytogate, GraphDraw, Diagram.Net och GraphNet. En uppsättning grafer genereras av dessa verktyg och vi mäter hur lång tid det tar för en användare att hitta den längsta vägen i grafen. Genom denna studie konstaterar vi att Cytogate presenterade grafer med best kvalitet. Från kunskap samlad i den inledande studien utvecklar vi CluStic och utför uppsatsens huvud studie där vi jämför CluStic med avseende på Cytogate och en bas layout Breddenförst algoritm. CluStic uppnår ett visualiserings effektivitetsvärde på 1,4 vilket är en ökning jämtemot Bredden-först algoritmen (-3,8). CluStic levererar inte layouter som är mer visuellt tillfredställande än de som skapats av Cytogate som får ett visualiserings effektivitetsvärde på 1,9. CluStic tillskillnad från Cytogate bevarar den internt fixa strukturen mellan element med hög prioritet vilket gör CluStic till det bättre verktyget för grafer med statiska element.

APA, Harvard, Vancouver, ISO, and other styles

5

Pampel, Barbara [Verfasser]. "Constrained Graph Drawing / Barbara Pampel." Konstanz : Bibliothek der Universität Konstanz, 2012. http://d-nb.info/1024457656/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

He, Dayu. "Algorithms for Graph Drawing Problems." Thesis, State University of New York at Buffalo, 2017. http://pqdtopen.proquest.com/#viewpdf?dispub=10284151.

Full text

Abstract:

<p> A graph G is called <i>planar</i> if it can be drawn on the plan such that no two distinct edges intersect each other but at common endpoints. Such drawing is called a plane embedding of <i>G.</i> A plane graph is a graph with a fixed embedding. A straight-line drawing <i>G</i> of a graph <i>G</i> = (<i>V, E</i>) is a drawing where each vertex of <i>V</i> is drawn as a distinct point on the plane and each edge of <i>G</i> is drawn as a line segment connecting two end vertices. In this thesis, we study a set of planar graph drawing problems. </p><p> First, we consider the problem of <i>monotone drawing:</i> A path <i>P</i> in a straight line drawing Γ is <i>monotone </i> if there exists a line l such that the orthogonal projections of the vertices of P on l appear along l in the order they appear in <i> P.</i> We call l a monotone line (or <i>monotone direction</i>) of <i>P. G</i> is called a monotone drawing of <i> G</i> if it contains at least one monotone path <i>P<sub>uw</sub></i> between every pair of vertices <i>u,w</i> of <i>G.</i> Monotone drawings were recently introduced by Angelini et al. and represent a new visualization paradigm, and is also closely related to several other important graph drawing problems. As in many graph drawing problems, one of the main concerns of this research is to reduce the drawing size, which is the size of the smallest integer grid such that every graph in the graph class can be drawn in such a grid. We present two approaches for the problem of monotone drawings of trees. Our first approach show that every <i>n</i>-vertex tree <i>T</i> admits a monotone drawing on a grid of size <i> O</i>(<i>n</i><sup>1.205</sup>) × <i>O</i>(<i> n</i><sup>1.205</sup>) grid. Our second approach further reduces the size of drawing to 12n × 12n, which is asymptotically optimal. Both of our two drawings can be constructed in <i>O(n)</i> time.</p><p> We also consider monotone drawings of 3-connected plane graphs. We prove that the classical Schnyder drawing of 3-connected plane graphs is a monotone drawing on a <i>f × f</i> grid, which can be constructed in <i> O(n)</i> time. </p><p> Second, we consider the problem of orthogonal drawing. An <i>orthogonal drawing</i> of a plane graph <i>G</i> is a planar drawing of <i> G</i> such that each vertex of <i>G</i> is drawn as a point on the plane, and each edge is drawn as a sequence of horizontal and vertical line segments with no crossings. Orthogonal drawing has attracted much attention due to its various applications in circuit schematics, relationship diagrams, data flow diagrams etc. . Rahman et al. gave a necessary and sufficient condition for a plane graph <i>G</i> of maximum degree 3 to have an orthogonal drawing without bends. An orthogonal drawing <i>D(G)</i> is <i> orthogonally</i> convex if all faces of <i>D(G)</i> are orthogonally convex polygons. Chang et al. gave a necessary and sufficient condition (which strengthens the conditions in the previous result) for a plane graph <i> G</i> of maximum degree 3 to have an orthogonal convex drawing without bends. We further strengthen the results such that if <i>G</i> satisfies the same conditions as in previous papers, it not only has an orthogonally convex drawing, but also a stronger star-shaped orthogonal drawing.</p><p>

APA, Harvard, Vancouver, ISO, and other styles

7

Lauw, Madelaine L. "TiddlyGraph : graph drawing tool for TiddlyWiki /." Leeds : University of Leeds, School of Computer Studies, 2008. http://www.comp.leeds.ac.uk/fyproj/reports/0708/Lauw.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Newton, Matthew. "Sequential and parallel algorithms for low-crossing graph drawing." Thesis, Loughborough University, 2007. https://dspace.lboro.ac.uk/2134/12944.

Full text

Abstract:

The one- and two-sided bipartite graph drawing problem alms to find a layout of a bipartite graph, with vertices of the two parts placed on parallel imaginary lines, that has the minimum number of edge-crossings. Vertices of one part are in fixed positions for the one-sided problem, whereas all vertices are free to move along their lines in the two-sided version. Many different heuristics exist for finding approximations to these problems, which are NP-hard. New sequential and parallel methods for producing drawings with low edgecrossings are investigated and compared to existing algorithms, notably Penalty Minimisation and Sifting, the current leaders. For the one-sided problem, new methods that include those based on simple stochastic hillclimbing, simulated annealing and genet.ic algorithms were tested. The new block-crossover genetic algorithm produced very good results with lower crossings than existing methods, although it tended to be slower. However, time was a secondary aim, the priority being to achieve low numbers of crossings. This algorithm can also be seeded with the output of an existing algorithm to improve results; combining with Penalty Minimisation in this way improved both the speed and number of crossings. Four parallel methods for the one-sided problem have been created, although two were abandoned because they gave bad results for even simple graphs. The other two methods, based on stochastic hill-climbing, produced acceptable results in faster times than similar sequential methods. PVM was used as the parallel communication system. Two new heuristics were studied for the two-sided problem, for which the only known existing method is to apply one-sided algorithms iteratively. The first is based on a heuristic for the linear arrangment problem; the second is a method of performing stochastic hill-climbing on two sides. A way of applying anyone-sided algorithm iteratively was also created. The linear arrangement method based on the Koren-Harel multi-scale algorithm achieved the best results, outperforming iterative Barycentre (previously the best method) and iterative Penalty Minimisation. Another area of this work created three new heuristics for the k-planar drawing problem where k > 1. These are the first known practical algorithms to solve this problem. A sequential genetic algorithm based on TimGA is devised to work on k-planar graphs. Two parallel algorithms, one island model and the other a 'mesh' model, are also given. Comparison of results for k = 2 indicate that the parallel island method is better than the other two methods. MPI was used for the parallel communication. Overall, 14 new methods are introduced, of which 10 were developed into working algorithms. For the one-sided bipartite graph drawing problem the new block-crossover genetic algorithm can produce drawings with lower crossings than the current best available algorithms. The parallel methods do not perform as well as the sequential ones, although they generally achieved the same results faster. All of the new two-sided methods worked well; the weighted two-sided swap stochastic hill-climbing method was comparable to the existing best method, iterative Barycentre, and generally produced drawings with lower crossings, although it suffered with needing a good termination condition. The new methods based on the linear arrangement problem consistently produced drawings with lower crossings than iterative Barycentre, although they were nearly always slower. A new parallel algorithm for the k-planar drawing problem, based on the island model, generally created drawings with the lowest edge-crossings, although no algorithms were known to exist to make comparisons.

APA, Harvard, Vancouver, ISO, and other styles

9

Cornelsen, Sabine. "Drawing families of cuts in a graph." [S.l. : s.n.], 2003. http://deposit.ddb.de/cgi-bin/dokserv?idn=967110165.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Klein, Karsten [Verfasser]. "Interactive graph drawing with constraints / Karsten Klein." Dortmund : Universitätsbibliothek Technische Universität Dortmund, 2011. http://d-nb.info/1011569876/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Graph drawing"

1

Duncan, Christian, and Antonios Symvonis, eds. Graph Drawing. Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-662-45803-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Mutzel, Petra, Michael Jünger, and Sebastian Leipert, eds. Graph Drawing. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45848-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

North, Stephen, ed. Graph Drawing. Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-62495-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Brandenburg, Franz J., ed. Graph Drawing. Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/bfb0021783.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Tollis, Ioannis G., and Maurizio Patrignani, eds. Graph Drawing. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-00219-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Goodrich, Michael T., and Stephen G. Kobourov, eds. Graph Drawing. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-36151-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Didimo, Walter, and Maurizio Patrignani, eds. Graph Drawing. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-36763-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Whitesides, Sue H., ed. Graph Drawing. Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/3-540-37623-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Wismath, Stephen, and Alexander Wolff, eds. Graph Drawing. Springer International Publishing, 2013. http://dx.doi.org/10.1007/978-3-319-03841-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Eppstein, David, and Emden R. Gansner, eds. Graph Drawing. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-11805-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Graph drawing"

1

Sharir, Micha, and Adam Sheffer. "Counting Plane Graphs: Cross-Graph Charging Schemes." In Graph Drawing. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-36763-2_3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Lisitsyn, Ivan A., and Victor N. Kasyanov. "Higres — Visualization System for Clustered Graphs and Graph Algorithms." In Graph Drawing. Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-46648-7_8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

van Wijk, Jarke J. "Graph Visualization." In Graph Drawing. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-25878-7_9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Abellanas, M., J. García, G. Hernández, M. Noy, and P. Ramos. "Bipartite embeddings of trees in the plane." In Graph Drawing. Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-62495-3_33.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Alzohairi, Mohammad, and Ivan Rival. "Series-parallel planar ordered sets have pagenumber two." In Graph Drawing. Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-62495-3_34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Bose, Prosenjit, Alice Dean, Joan Hutchinson, and Thomas Shermer. "On rectangle visibility graphs." In Graph Drawing. Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-62495-3_35.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Bridgeman, Stina, Ashim Garg, and Roberto Tamassia. "A graph drawing and translation service on the WWW." In Graph Drawing. Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-62495-3_36.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Calamoneri, Tiziana, and Andrea Sterbini. "Drawing 2-, 3- and 4-colorable graphs in O(n2) volume." In Graph Drawing. Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-62495-3_37.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Chan, Timothy, S. Rao Kosaraju, Michael T. Goodrich, and Roberto Tamassia. "Optimizing area and aspect ratio in straight-line orthogonal tree drawings." In Graph Drawing. Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-62495-3_38.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Battista, Giuseppe, Ashim Garg, Giuseppe Liotta, et al. "Drawing directed acyclic graphs: An experimental study." In Graph Drawing. Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-62495-3_39.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Graph drawing"

1

Da Lozzo, Giordano, Marco Di Bartolomeo, Maurizio Patrignani, Giuseppe Di Battista, Davide Cannone, and Sergio Tortora. "Drawing Georeferenced Graphs - Combining Graph Drawing and Geographic Data." In International Conference on Information Visualization Theory and Applications. SCITEPRESS - Science and and Technology Publications, 2015. http://dx.doi.org/10.5220/0005266601090116.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Di Giacomo, Emilio, Walter Didimo, Seok-hee Hong, et al. "Low ply graph drawing." In 2015 6th International Conference on Information, Intelligence, Systems and Applications (IISA). IEEE, 2015. http://dx.doi.org/10.1109/iisa.2015.7388020.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Ibrahim, Bertrand, Honitriniela Randriamparany, and Hidenori Yoshizumi. "Relevance of graph-drawing algorithms to graph-based interfaces." In the working conference. ACM Press, 2000. http://dx.doi.org/10.1145/345513.345357.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Niggemann, Oliver, and Benno Stein. "A meta heuristic for graph drawing." In the working conference. ACM Press, 2000. http://dx.doi.org/10.1145/345513.345354.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Samaranayake, Meththa, Helen Ji, and John Ainscough. "Graph drawing alogorithms based module placement." In 2009 International Symposium on Signals, Circuits and Systems - ISSCS 2009. IEEE, 2009. http://dx.doi.org/10.1109/isscs.2009.5206087.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Hosobe, Hiroshi. "Numerical optimization-based graph drawing revisited." In 2012 IEEE Pacific Visualization Symposium (PacificVis). IEEE, 2012. http://dx.doi.org/10.1109/pacificvis.2012.6183577.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Dobkin, David P., Emden R. Gansner, E. Koutsofios, and S. C. North. "A path router for graph drawing." In the fourteenth annual symposium. ACM Press, 1998. http://dx.doi.org/10.1145/276884.276935.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Xue-ling Song, Chao-ying Liu, Zhe-ying Song, and Li-chong Peng. "Stepping motor graph drawing system design." In 2007 IEEE International Conference on Grey Systems and Intelligent Services. IEEE, 2007. http://dx.doi.org/10.1109/gsis.2007.4443537.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Cohen, R. F., G. Di Battista, R. Tamassia, I. G. Tollis, and P. Bertolazzi. "A framework for dynamic graph drawing." In the eighth annual symposium. ACM Press, 1992. http://dx.doi.org/10.1145/142675.142728.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Hong, Seok-Hee, Peter Eades, Marnijati Torkel, James Wood, and Kunsoo Park. "Louvain-based Multi-level Graph Drawing." In 2021 IEEE 14th Pacific Visualization Symposium (PacificVis). IEEE, 2021. http://dx.doi.org/10.1109/pacificvis52677.2021.00028.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Graph drawing"

1

Fu, Xiangyang, Guangdao Gao, and Peng Yang. Aircraft Drawing-Die Design CAD Expert System Based on Engineering Graph,. Defense Technical Information Center, 1995. http://dx.doi.org/10.21236/ada300179.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!