Relevant bibliographies by topics / Graph drawing

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Graph drawing'

Author: Grafiati
Published: 4 June 2021
Last updated: 25 July 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
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

Dib, Fadi K., and Peter Rodgers. "Graph drawing using Jaya." PLOS ONE 18, no. 6 (2023): e0287744. http://dx.doi.org/10.1371/journal.pone.0287744.

Full text
Abstract:
Graph drawing, involving the automatic layout of graphs, is vital for clear data visualization and interpretation but poses challenges due to the optimization of a multi-metric objective function, an area where current search-based methods seek improvement. In this paper, we investigate the performance of Jaya algorithm for automatic graph layout with straight lines. Jaya algorithm has not been previously used in the field of graph drawing. Unlike most population-based methods, Jaya algorithm is a parameter-less algorithm in that it requires no algorithm-specific control parameters and only po
APA, Harvard, Vancouver, ISO, and other styles
5

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
6

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
7

Binucci, Carla, Aaron Büngener, Giuseppe Di Battista, et al. "Min-$k$-planar Drawings of Graphs." Journal of Graph Algorithms and Applications 28, no. 2 (2024): 1–35. http://dx.doi.org/10.7155/jgaa.v28i2.2925.

Full text
Abstract:
The study of nonplanar drawings of graphs with restricted crossing configurations is a well-established topic in graph drawing, often referred to as beyond-planar graph drawing. One of the most studied types of drawings in this area are the $k$-planar drawings $(k \geq 1)$, where each edge cannot cross more than $k$ times. We generalize $k$-planar drawings, by introducing the new family of min-$k$-planar drawings. In a min-$k$-planar drawing edges can cross an arbitrary number of times, but for any two crossing edges, one of the two must have no more than $k$ crossings. We prove a general uppe
APA, Harvard, Vancouver, ISO, and other styles
8

YELTEKİN ATAR, Betül Şeyma, and Işıl AYKUTLU. "High School Students’ User Skills Concerning Force and Motion Graphs." Gazi Üniversitesi Gazi Eğitim Fakültesi Dergisi 43, no. 1 (2023): 211–42. http://dx.doi.org/10.17152/gefad.1205369.

Full text
Abstract:
In this study, the aim was to examine Year 11 students’ skills of reading-interpreting and drawing graphs of force and motion and to lay bare the relationship between graph reading-interpretation and drawing graphs. Conducted in the survey model, the study was realised with the participation of 209 Year 11 students studying at Anatolian high schools in Ankara. Graph Reading and Interpretation Skills Test (GRIST) which includes 13 multiple-choice items and Graph Drawing Skills Form (GDSF) which includes 5 open-ended items were used as data collection tools. At the end of the study, it was deter
APA, Harvard, Vancouver, ISO, and other styles
9

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
10

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 appea
APA, Harvard, Vancouver, ISO, and other styles
More sources

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 soluti
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." Tönning Marburg Lü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 capabili
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>mo
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, n
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
More sources

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
More sources

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

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
3

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
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

Chen, Peidong, Qingming Zhang, Desen Yang, and Jian Gou. "TGD: Topology-Enhanced Framework for Graph Drawing." In 2024 17th International Congress on Image and Signal Processing, BioMedical Engineering and Informatics (CISP-BMEI). IEEE, 2024. https://doi.org/10.1109/cisp-bmei64163.2024.10906230.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Sihan, Huang, Qin Zhi, Zhang Shibin, Chang Yan, and Yan Lili. "Research of Drawing Data Asset Graph Based on Force-Oriented Algorithm." In 2024 21st International Computer Conference on Wavelet Active Media Technology and Information Processing (ICCWAMTIP). IEEE, 2024. https://doi.org/10.1109/iccwamtip64812.2024.10873767.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Dyken, Landon, Will Usher, Steve Petruzza, Stavros Sintos, and Sidharth Kumar. "Accelerating Web-Based Graph Drawing with Bottom-Up GPU Quadtree Construction." In 2025 IEEE 18th Pacific Visualization Conference (PacificVis). IEEE, 2025. https://doi.org/10.1109/pacificvis64226.2025.00008.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Çela, Keisi, Stef van den Elzen, Jarke van Wijk, and Alessio Arleo. "Why Does It Look like this? Introducing a Preliminary Framework for Explainable Graph Drawing (XGD)." In 16th International Conference on Information Visualization Theory and Applications. SCITEPRESS - Science and Technology Publications, 2025. https://doi.org/10.5220/0013111100003912.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

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
6

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
7

Baumann, Jakob, Ignaz Rutter, and Dirk Sudholt. "Evolutionary Computation Meets Graph Drawing: Runtime Analysis for Crossing Minimisation on Layered Graph Drawings." In GECCO '24: Genetic and Evolutionary Computation Conference. ACM, 2024. http://dx.doi.org/10.1145/3638529.3654105.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

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
9

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
10

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

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
2

Oyen, Diane, and Michal Kucer. Analysis and Understanding of Drawings using Deep Learning and Graphs. Office of Scientific and Technical Information (OSTI), 2023. http://dx.doi.org/10.2172/1992218.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

The Bank at Work - Head Office - Banking Department, Judy Symonds drawing graphs with Bill Robinson - 1960. Reserve Bank of Australia, 2023. http://dx.doi.org/10.47688/rba_archives_pn-006376.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Graph drawing' for particular source types:
Journal articles Dissertations / Theses Books
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!

To the bibliography