Graph drawing (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Graph drawing" in English language version.

refsWebsite

Global rank English rank

20doi.org

2^nd place

4web.archive.org

1^st place

4ams.org

451^st place

277^th place

4nih.gov

4^th place

3semanticscholar.org

11^th place

8^th place

2psu.edu

207^th place

136^th place

2books.google.com

3^rd place

1cairn.info

879^th place

3,323^rd place

1microsoft.com

153^rd place

151^st place

1harvard.edu

18^th place

17^th place

1hawaii.edu

1,308^th place

924^th place

1arquivo.pt

1,668^th place

1,164^th place

1wolfram.com

513^th place

537^th place

1uni-luebeck.de

low place

1springer.com

274^th place

309^th place

1worldcat.org

5^th place

ams.org (Global: 451^st place; English: 277^th place)

mathscinet.ams.org

Garg & Tamassia (1995). Garg, Ashim; Tamassia, Roberto (1995), "Upward planarity testing", Order, 12 (2): 109–133, CiteSeerX 10.1.1.10.2237, doi:10.1007/BF01108622, MR 1354797, S2CID 14183717.
Beckman (1994); Koren (2005). Beckman, Brian (1994), Theory of Spectral Graph Layout, Tech. Report MSR-TR-94-04, Microsoft Research, archived from the original on 2016-04-01, retrieved 2011-09-17. Koren, Yehuda (2005), "Drawing graphs by eigenvectors: theory and practice", Computers & Mathematics with Applications, 49 (11–12): 1867–1888, doi:10.1016/j.camwa.2004.08.015, MR 2154691.
Sugiyama, Tagawa & Toda (1981); Bastert & Matuszewski (2001); Di Battista et al. (1998), Chapter 9, "Layered Drawings of Digraphs", pp. 265–302. Sugiyama, Kozo; Tagawa, Shôjirô; Toda, Mitsuhiko (1981), "Methods for visual understanding of hierarchical system structures", IEEE Transactions on Systems, Man, and Cybernetics, SMC-11 (2): 109–125, doi:10.1109/TSMC.1981.4308636, MR 0611436, S2CID 8367756. Bastert, Oliver; Matuszewski, Christian (2001), "Layered drawings of digraphs", in Kaufmann, Michael; Wagner, Dorothea (eds.), Drawing Graphs: Methods and Models, Lecture Notes in Computer Science, vol. 2025, Springer-Verlag, pp. 87–120, doi:10.1007/3-540-44969-8_5, ISBN 978-3-540-42062-0.

ams.org

Zapponi (2003). Zapponi, Leonardo (August 2003), "What is a Dessin d'Enfant" (PDF), Notices of the American Mathematical Society, 50: 788–789, archived (PDF) from the original on 2021-10-03, retrieved 2021-04-28.

arquivo.pt (Global: 1,668^th place; English: 1,164^th place)

Di Battista et al. (1998), pp. 15–16, and Chapter 6, "Flow and Upward Planarity", pp. 171–214; Freese (2004). Freese, Ralph (2004), "Automated lattice drawing", in Eklund, Peter (ed.), Concept Lattices: Second International Conference on Formal Concept Analysis, ICFCA 2004, Sydney, Australia, February 23-26, 2004, Proceedings (PDF), Lecture Notes in Computer Science, vol. 2961, Springer-Verlag, pp. 589–590, CiteSeerX 10.1.1.69.6245, doi:10.1007/978-3-540-24651-0_12, ISBN 978-3-540-21043-6, archived (PDF) from the original on 2016-03-14, retrieved 2011-09-17.

books.google.com (Global: 3^rd place; English: 3^rd place)

Scott (2000); Brandes, Freeman & Wagner (2014). Scott, John (2000), "Sociograms and Graph Theory", Social network analysis: a handbook (2nd ed.), Sage, pp. 64–69, ISBN 978-0-7619-6339-4. Brandes, Ulrik; Freeman, Linton C.; Wagner, Dorothea (2014), "Social Networks", in Tamassia, Roberto (ed.), Handbook of Graph Drawing and Visualization, CRC Press, pp. 805–839.
Anderson & Head (2006). Anderson, James Andrew; Head, Thomas J. (2006), Automata Theory with Modern Applications, Cambridge University Press, pp. 38–41, ISBN 978-0-521-84887-9.

cairn.info (Global: 879^th place; English: 3,323^rd place)

Grandjean (2014). Grandjean, Martin (2014), "La connaissance est un réseau", Les Cahiers du Numérique, 10 (3): 37–54, doi:10.3166/lcn.10.3.37-54, archived from the original on 2015-06-27, retrieved 2014-10-15.

doi.org (Global: 2^nd place; English: 2^nd place)

Di Battista et al. (1998), pp. vii–viii; Herman, Melançon & Marshall (2000), Section 1.1, "Typical Application Areas". Herman, Ivan; Melançon, Guy; Marshall, M. Scott (2000), "Graph Visualization and Navigation in Information Visualization: A Survey", IEEE Transactions on Visualization and Computer Graphics, 6 (1): 24–43, doi:10.1109/2945.841119.
Misue et al. (1995). Misue, K.; Eades, P.; Lai, W.; Sugiyama, K. (1995), "Layout Adjustment and the Mental Map", Journal of Visual Languages & Computing, 6 (2): 183–210, doi:10.1006/jvlc.1995.1010.
Garg & Tamassia (1995). Garg, Ashim; Tamassia, Roberto (1995), "Upward planarity testing", Order, 12 (2): 109–133, CiteSeerX 10.1.1.10.2237, doi:10.1007/BF01108622, MR 1354797, S2CID 14183717.
Longabaugh (2012). Longabaugh, William (2012), "Combing the hairball with BioFabric: a new approach for visualization of large networks", BMC Bioinformatics, 13 275, doi:10.1186/1471-2105-13-275, PMC 3574047, PMID 23102059.
Di Battista et al. (1998), Section 2.1.2, Aesthetics, pp. 14–16; Purchase, Cohen & James (1997). Purchase, H. C.; Cohen, R. F.; James, M. I. (1997), "An experimental study of the basis for graph drawing algorithms", Journal of Experimental Algorithmics, 2, Article 4, doi:10.1145/264216.264222, S2CID 22076200.
Grandjean (2014). Grandjean, Martin (2014), "La connaissance est un réseau", Les Cahiers du Numérique, 10 (3): 37–54, doi:10.3166/lcn.10.3.37-54, archived from the original on 2015-06-27, retrieved 2014-10-15.
Beckman (1994); Koren (2005). Beckman, Brian (1994), Theory of Spectral Graph Layout, Tech. Report MSR-TR-94-04, Microsoft Research, archived from the original on 2016-04-01, retrieved 2011-09-17. Koren, Yehuda (2005), "Drawing graphs by eigenvectors: theory and practice", Computers & Mathematics with Applications, 49 (11–12): 1867–1888, doi:10.1016/j.camwa.2004.08.015, MR 2154691.
Di Battista et al. (1998), Chapter 5, "Flow and Orthogonal Drawings", pp. 137–170; Eiglsperger, Fekete & Klau (2001). Eiglsperger, Markus; Fekete, Sándor; Klau, Gunnar (2001), "Orthogonal graph drawing", in Kaufmann, Michael; Wagner, Dorothea (eds.), Drawing Graphs, Lecture Notes in Computer Science, vol. 2025, Springer Berlin / Heidelberg, pp. 121–171, doi:10.1007/3-540-44969-8_6, ISBN 978-3-540-42062-0.
Herman, Melançon & Marshall (2000), Section 2.2, "Traditional Layout – An Overview". Herman, Ivan; Melançon, Guy; Marshall, M. Scott (2000), "Graph Visualization and Navigation in Information Visualization: A Survey", IEEE Transactions on Visualization and Computer Graphics, 6 (1): 24–43, doi:10.1109/2945.841119.
Sugiyama, Tagawa & Toda (1981); Bastert & Matuszewski (2001); Di Battista et al. (1998), Chapter 9, "Layered Drawings of Digraphs", pp. 265–302. Sugiyama, Kozo; Tagawa, Shôjirô; Toda, Mitsuhiko (1981), "Methods for visual understanding of hierarchical system structures", IEEE Transactions on Systems, Man, and Cybernetics, SMC-11 (2): 109–125, doi:10.1109/TSMC.1981.4308636, MR 0611436, S2CID 8367756. Bastert, Oliver; Matuszewski, Christian (2001), "Layered drawings of digraphs", in Kaufmann, Michael; Wagner, Dorothea (eds.), Drawing Graphs: Methods and Models, Lecture Notes in Computer Science, vol. 2025, Springer-Verlag, pp. 87–120, doi:10.1007/3-540-44969-8_5, ISBN 978-3-540-42062-0.
Saaty (1964). Saaty, Thomas L. (1964), "The minimum number of intersections in complete graphs", Proc. Natl. Acad. Sci. U.S.A., 52 (3): 688–690, Bibcode:1964PNAS...52..688S, doi:10.1073/pnas.52.3.688, PMC 300329, PMID 16591215.
Doğrusöz, Madden & Madden (1997). Doğrusöz, Uğur; Madden, Brendan; Madden, Patrick (1997), "Circular layout in the Graph Layout toolkit", in North, Stephen (ed.), Symposium on Graph Drawing, GD '96 Berkeley, California, USA, September 18–20, 1996, Proceedings, Lecture Notes in Computer Science, vol. 1190, Springer-Verlag, pp. 92–100, doi:10.1007/3-540-62495-3_40, ISBN 978-3-540-62495-0.
Di Battista et al. (1998), pp. 15–16, and Chapter 6, "Flow and Upward Planarity", pp. 171–214; Freese (2004). Freese, Ralph (2004), "Automated lattice drawing", in Eklund, Peter (ed.), Concept Lattices: Second International Conference on Formal Concept Analysis, ICFCA 2004, Sydney, Australia, February 23-26, 2004, Proceedings (PDF), Lecture Notes in Computer Science, vol. 2961, Springer-Verlag, pp. 589–590, CiteSeerX 10.1.1.69.6245, doi:10.1007/978-3-540-24651-0_12, ISBN 978-3-540-21043-6, archived (PDF) from the original on 2016-03-14, retrieved 2011-09-17.
Reingold & Tilford (1981). Reingold, Edward M.; Tilford, John S. (1981). "Tidier drawings of trees". IEEE Transactions on Software Engineering. 2 (2): 223–228. doi:10.1109/TSE.1981.234519.
Gutwenger & Mutzel (1998). Gutwenger, Carsten; Mutzel, Petra (1998). "Planar Polyline Drawings with Good Angular Resolution". In Sue Whitesides (ed.). Graph Drawing, 6th International Symposium. Springer. pp. 167–182. doi:10.1007/3-540-37623-2_13.
Tamassia (1987). Tamassia, Roberto (1987). "On Embedding a Graph in the Grid with the Minimum Number of Bends". SIAM Journal on Computing. 16 (3): 421–444. doi:10.1137/0216030.
Sugiyama & Misue (1995). Sugiyama, Kozo; Misue, Kazuo (1995). "Graph drawing by the magnetic spring model". Journal of Visual Languages & Computing. 6 (3): 217–231. doi:10.1006/jvlc.1995.1013.
Nachmanson, Robertson & Lee (2008). Nachmanson, Lev; Robertson, George; Lee, Bongshin (2008), "Drawing Graphs with GLEE", in Hong, Seok-Hee; Nishizeki, Takao; Quan, Wu (eds.), Graph Drawing, 15th International Symposium, GD 2007, Sydney, Australia, September 24–26, 2007, Revised Papers, Lecture Notes in Computer Science, vol. 4875, Springer-Verlag, pp. 389–394, doi:10.1007/978-3-540-77537-9_38, ISBN 978-3-540-77536-2.
Tantau (2013); see also the older GD 2012 presentation Archived 2016-05-27 at the Wayback Machine Tantau, Till (2013), "Graph Drawing in TikZ", Journal of Graph Algorithms and Applications, 17 (4): 495–513, doi:10.7155/jgaa.00301 (inactive July 15, 2025){{citation}}: CS1 maint: DOI inactive as of July 2025 (link).
Fink, Simon D.; Strobl, Andreas (2023). "odgf-python – A Python Interface for the Open Graph Drawing Framework". In Bekos, Michael A.; Chimani, Markus (eds.). Graph Drawing and Network Visualization. Lecture Notes in Computer Science. pp. 258–260. doi:10.1007/978-3-031-49275-4. ISSN 0302-9743. The Open Graph Drawing Framework (OGDF) is a C++ library that contains a vast amount of algorithms and data structures for automatic graph drawing.

harvard.edu (Global: 18^th place; English: 17^th place)

ui.adsabs.harvard.edu

Saaty (1964). Saaty, Thomas L. (1964), "The minimum number of intersections in complete graphs", Proc. Natl. Acad. Sci. U.S.A., 52 (3): 688–690, Bibcode:1964PNAS...52..688S, doi:10.1073/pnas.52.3.688, PMC 300329, PMID 16591215.

hawaii.edu (Global: 1,308^th place; English: 924^th place)

math.hawaii.edu

Di Battista et al. (1998), pp. 15–16, and Chapter 6, "Flow and Upward Planarity", pp. 171–214; Freese (2004). Freese, Ralph (2004), "Automated lattice drawing", in Eklund, Peter (ed.), Concept Lattices: Second International Conference on Formal Concept Analysis, ICFCA 2004, Sydney, Australia, February 23-26, 2004, Proceedings (PDF), Lecture Notes in Computer Science, vol. 2961, Springer-Verlag, pp. 589–590, CiteSeerX 10.1.1.69.6245, doi:10.1007/978-3-540-24651-0_12, ISBN 978-3-540-21043-6, archived (PDF) from the original on 2016-03-14, retrieved 2011-09-17.

microsoft.com (Global: 153^rd place; English: 151^st place)

research.microsoft.com

Beckman (1994); Koren (2005). Beckman, Brian (1994), Theory of Spectral Graph Layout, Tech. Report MSR-TR-94-04, Microsoft Research, archived from the original on 2016-04-01, retrieved 2011-09-17. Koren, Yehuda (2005), "Drawing graphs by eigenvectors: theory and practice", Computers & Mathematics with Applications, 49 (11–12): 1867–1888, doi:10.1016/j.camwa.2004.08.015, MR 2154691.

nih.gov (Global: 4^th place; English: 4^th place)

ncbi.nlm.nih.gov

Longabaugh (2012). Longabaugh, William (2012), "Combing the hairball with BioFabric: a new approach for visualization of large networks", BMC Bioinformatics, 13 275, doi:10.1186/1471-2105-13-275, PMC 3574047, PMID 23102059.
Saaty (1964). Saaty, Thomas L. (1964), "The minimum number of intersections in complete graphs", Proc. Natl. Acad. Sci. U.S.A., 52 (3): 688–690, Bibcode:1964PNAS...52..688S, doi:10.1073/pnas.52.3.688, PMC 300329, PMID 16591215.

pubmed.ncbi.nlm.nih.gov

Longabaugh (2012). Longabaugh, William (2012), "Combing the hairball with BioFabric: a new approach for visualization of large networks", BMC Bioinformatics, 13 275, doi:10.1186/1471-2105-13-275, PMC 3574047, PMID 23102059.
Saaty (1964). Saaty, Thomas L. (1964), "The minimum number of intersections in complete graphs", Proc. Natl. Acad. Sci. U.S.A., 52 (3): 688–690, Bibcode:1964PNAS...52..688S, doi:10.1073/pnas.52.3.688, PMC 300329, PMID 16591215.

psu.edu (Global: 207^th place; English: 136^th place)

citeseerx.ist.psu.edu

Garg & Tamassia (1995). Garg, Ashim; Tamassia, Roberto (1995), "Upward planarity testing", Order, 12 (2): 109–133, CiteSeerX 10.1.1.10.2237, doi:10.1007/BF01108622, MR 1354797, S2CID 14183717.
Di Battista et al. (1998), pp. 15–16, and Chapter 6, "Flow and Upward Planarity", pp. 171–214; Freese (2004). Freese, Ralph (2004), "Automated lattice drawing", in Eklund, Peter (ed.), Concept Lattices: Second International Conference on Formal Concept Analysis, ICFCA 2004, Sydney, Australia, February 23-26, 2004, Proceedings (PDF), Lecture Notes in Computer Science, vol. 2961, Springer-Verlag, pp. 589–590, CiteSeerX 10.1.1.69.6245, doi:10.1007/978-3-540-24651-0_12, ISBN 978-3-540-21043-6, archived (PDF) from the original on 2016-03-14, retrieved 2011-09-17.

semanticscholar.org (Global: 11^th place; English: 8^th place)

api.semanticscholar.org

Garg & Tamassia (1995). Garg, Ashim; Tamassia, Roberto (1995), "Upward planarity testing", Order, 12 (2): 109–133, CiteSeerX 10.1.1.10.2237, doi:10.1007/BF01108622, MR 1354797, S2CID 14183717.
Di Battista et al. (1998), Section 2.1.2, Aesthetics, pp. 14–16; Purchase, Cohen & James (1997). Purchase, H. C.; Cohen, R. F.; James, M. I. (1997), "An experimental study of the basis for graph drawing algorithms", Journal of Experimental Algorithmics, 2, Article 4, doi:10.1145/264216.264222, S2CID 22076200.
Sugiyama, Tagawa & Toda (1981); Bastert & Matuszewski (2001); Di Battista et al. (1998), Chapter 9, "Layered Drawings of Digraphs", pp. 265–302. Sugiyama, Kozo; Tagawa, Shôjirô; Toda, Mitsuhiko (1981), "Methods for visual understanding of hierarchical system structures", IEEE Transactions on Systems, Man, and Cybernetics, SMC-11 (2): 109–125, doi:10.1109/TSMC.1981.4308636, MR 0611436, S2CID 8367756. Bastert, Oliver; Matuszewski, Christian (2001), "Layered drawings of digraphs", in Kaufmann, Michael; Wagner, Dorothea (eds.), Drawing Graphs: Methods and Models, Lecture Notes in Computer Science, vol. 2025, Springer-Verlag, pp. 87–120, doi:10.1007/3-540-44969-8_5, ISBN 978-3-540-42062-0.

springer.com (Global: 274^th place; English: 309^th place)

link.springer.com

Fink, Simon D.; Strobl, Andreas (2023). "odgf-python – A Python Interface for the Open Graph Drawing Framework". In Bekos, Michael A.; Chimani, Markus (eds.). Graph Drawing and Network Visualization. Lecture Notes in Computer Science. pp. 258–260. doi:10.1007/978-3-031-49275-4. ISSN 0302-9743. The Open Graph Drawing Framework (OGDF) is a C++ library that contains a vast amount of algorithms and data structures for automatic graph drawing.

uni-luebeck.de (Global: low place; English: low place)

tcs.uni-luebeck.de

Tantau (2013); see also the older GD 2012 presentation Archived 2016-05-27 at the Wayback Machine Tantau, Till (2013), "Graph Drawing in TikZ", Journal of Graph Algorithms and Applications, 17 (4): 495–513, doi:10.7155/jgaa.00301 (inactive July 15, 2025){{citation}}: CS1 maint: DOI inactive as of July 2025 (link).

web.archive.org (Global: 1^st place; English: 1^st place)

Grandjean (2014). Grandjean, Martin (2014), "La connaissance est un réseau", Les Cahiers du Numérique, 10 (3): 37–54, doi:10.3166/lcn.10.3.37-54, archived from the original on 2015-06-27, retrieved 2014-10-15.
Beckman (1994); Koren (2005). Beckman, Brian (1994), Theory of Spectral Graph Layout, Tech. Report MSR-TR-94-04, Microsoft Research, archived from the original on 2016-04-01, retrieved 2011-09-17. Koren, Yehuda (2005), "Drawing graphs by eigenvectors: theory and practice", Computers & Mathematics with Applications, 49 (11–12): 1867–1888, doi:10.1016/j.camwa.2004.08.015, MR 2154691.
Zapponi (2003). Zapponi, Leonardo (August 2003), "What is a Dessin d'Enfant" (PDF), Notices of the American Mathematical Society, 50: 788–789, archived (PDF) from the original on 2021-10-03, retrieved 2021-04-28.
Tantau (2013); see also the older GD 2012 presentation Archived 2016-05-27 at the Wayback Machine Tantau, Till (2013), "Graph Drawing in TikZ", Journal of Graph Algorithms and Applications, 17 (4): 495–513, doi:10.7155/jgaa.00301 (inactive July 15, 2025){{citation}}: CS1 maint: DOI inactive as of July 2025 (link).

wolfram.com (Global: 513^th place; English: 537^th place)

reference.wolfram.com

"Introduction to graph drawing", Wolfram Language & System Documentation Center, retrieved 2024-03-21

worldcat.org (Global: 5^th place; English: 5^th place)

search.worldcat.org

Fink, Simon D.; Strobl, Andreas (2023). "odgf-python – A Python Interface for the Open Graph Drawing Framework". In Bekos, Michael A.; Chimani, Markus (eds.). Graph Drawing and Network Visualization. Lecture Notes in Computer Science. pp. 258–260. doi:10.1007/978-3-031-49275-4. ISSN 0302-9743. The Open Graph Drawing Framework (OGDF) is a C++ library that contains a vast amount of algorithms and data structures for automatic graph drawing.

Graph drawing (English Wikipedia)

ams.org (Global: 451st place; English: 277th place)

mathscinet.ams.org

ams.org

arquivo.pt (Global: 1,668th place; English: 1,164th place)

books.google.com (Global: 3rd place; English: 3rd place)

cairn.info (Global: 879th place; English: 3,323rd place)

doi.org (Global: 2nd place; English: 2nd place)

harvard.edu (Global: 18th place; English: 17th place)