GLaDOS: Graph Layout algorithm Datasets for Open Science
Article Sidebar
Main Article Content
Abstract
Introduction
Computational evaluations are crucial for standardized and objective evaluation of graph layout algorithms. Standard benchmark datasets facilitate comparison with prior work, and reliable access to datasets is fundamental for replicability. However, there is no comprehensive repository of benchmark datasets for Graph Drawing, and many datasets have been lost.
Data collection
We collected 196 papers from Graph Drawing, IEEE venues, and Eurographics venues that include computational evaluations of graph layout algorithms. We searched for the datasets used.
Data analysis
We archived datasets we found and re-created ones that were lost but had sufficient replication instructions. We classified graphs by their features and statistics. We also found text and images from papers using those graphs.
Implementation
We implemented graph creation, data analysis, and website code.
Materials
We provide a Graph Layout Benchmark Datasets website and a long-term archive which includes the documentation, code, and data for the website, benchmark datasets, analysis code, graph conversion code, and this paper.
Conclusion
We provide a resource for the Graph Drawing and visualization communities to use to find datasets for computational evaluations of graph layout algorithms. Our organization by features and statistics supports rapid identification of relevant graphs. We have re-created and archived graphs used in research for their long-term preservation.
Article Details
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
References
Adai, Alex T., Shailesh V. Date, Shannon Wieland, and Edward M. Marcotte. 2004. “LGL: Creating a Map of Protein Function with an Algorithm for Visualizing Very Large Biological Networks.” Journal of Molecular Biology 340 (1): 179–90. https://doi.org/10.1016/j.jmb.2004.04.047.
Ahmed, Reyan, Felice De Luca, Sabin Devkota, Stephen Kobourov, and Mingwei Li. 2020. “Graph Drawing via Gradient Descent, (GD).” In Lecture Notes in Computer Science, 3–17. Springer International Publishing. https://doi.org/10.1007/978-3-030-68766-3_1.
Alegrı́a, Carlos, Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, and Maurizio Patrignani. 2021. “Planar Straight-Line Realizations of 2-Trees with Prescribed Edge Lengths.” In Lecture Notes in Computer Science, 166–83. Springer International Publishing. https://doi.org/10.1007/978-3-030-92931-2_12.
Angori, Lorenzo, Walter Didimo, Fabrizio Montecchiani, Daniele Pagliuca, and Alessandra Tappini. 2019. “ChordLink: A New Hybrid Visualization Model.” In Lecture Notes in Computer Science, 276–90. Springer International Publishing. https://doi.org/10.1007/978-3-030-35802-0_22.
Arleo, Alessio, Walter Didimo, Giuseppe Liotta, and Fabrizio Montecchiani. 2019. “A Distributed Multilevel Force-Directed Algorithm.” IEEE Transactions on Parallel and Distributed Systems 30 (4): 754–65. https://doi.org/10.1109/tpds.2018.2869805.
Arleo, A., S. Miksch, and D. Archambault. 2022. “Event-Based Dynamic Graph Drawing Without the Agonizing Pain.” Computer Graphics Forum 41 (6): 226–44. https://doi.org/10.1111/cgf.14615.
Bach, Benjamin, Emmanuel Pietriga, and Jean-Daniel Fekete. 2014. “GraphDiaries: Animated Transitions andTemporal Navigation for Dynamic Networks.” IEEE Transactions on Visualization and Computer Graphics 20 (5): 740–54. https://doi.org/10.1109/tvcg.2013.254.
Bachmaier, Christian, Franz Josef Brandenburg, Philip Effinger, Carsten Gutwenger, Jyrki Katajainen, Karsten Klein, Miro Spönemann, Matthias Stegmaier, and Michael Wybrow. 2012. “The Open Graph Archive: A Community-Driven Effort.” In Graph Drawing, edited by Marc van Kreveld and Bettina Speckmann, 435–40. Berlin, Heidelberg: Springer Berlin Heidelberg.
Bachmaier, Christian, Andreas Gleißner, and Andreas Hofmeier. 2012. “DAGmar: Library for DAGs.” https://www.infosun.fim.uni-passau.de/~chris/down/MIP-1202.pdf.
Ballweg, Kathrin, Margit Pohl, Günter Wallner, and Tatiana von Landesberger. 2018. “Visual Similarity Perception of Directed Acyclic Graphs: A Study on Influencing Factors and Similarity Judgment Strategies.” Journal of Graph Algorithms and Applications 22 (3): 519–53. https://doi.org/10.7155/jgaa.00467.
Barabási, Albert-László, and Réka Albert. 1999. “Emergence of Scaling in Random Networks.” Science 286 (5439): 509–12. https://doi.org/10.1126/science.286.5439.509
1 comment on PubPeer (by: Unregistered Submission)
.
Barnes, Josh, and Piet Hut. 1986. “A Hierarchical o(n Log n) Force-Calculation Algorithm.” Nature 324 (6096): 446–49. https://doi.org/10.1038/324446a0.
Barth, Wilhelm, Michael Jünger, and Petra Mutzel. 2002. “Simple and Efficient Bilayer Cross Counting.” In Graph Drawing, edited by Michael T. Goodrich and Stephen G. Kobourov, 130–41. Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-36151-0_13.
Bast, Hannah, Patrick Brosi, and Sabine Storandt. 2020. “Metro Maps on Octilinear Grid Graphs.” Computer Graphics Forum 39 (3): 357–67. https://doi.org/10.1111/cgf.13986.
Batagelj, Vladimir, and Andrej Mrvar. 2006. “Pajek Datasets.” In. http://vlado.fmf.uni-lj.si/pub/networks/data/.
Batik, T., S. Terziadis, Y.-S. Wang, M. Nöllenburg, and H.-Y. Wu. 2022. “Shape-Guided Mixed Metro Map Layout.” Computer Graphics Forum 41 (7): 495–506. https://doi.org/10.1111/cgf.14695.
Battista, Giuseppe Di, Ashim Garg, Giuseppe Liotta, Armando Parise, Roberto Tamassia, Emanuele Tassinari, Francesco Vargiu, and Luca Vismara. 2000. “Drawing Directed Acyclic Graphs: An Experimental Study.” International Journal of Computational Geometry & Applications 10 (06): 623–48. https://doi.org/10.1142/s0218195900000358.
Battista, Giuseppe Di, Ashim Garg, Giuseppe Liotta, Roberto Tamassia, Emanuele Tassinari, and Francesco Vargiu. 1997. “An Experimental Comparison of Four Graph Drawing Algorithms.” Computational Geometry 7 (5-6): 303–25. https://doi.org/10.1016/s0925-7721(96)00005-3.
Baumert, Kevin A., Timothy Herzog, and Jonathan Pershing. 2005. “Navigating the Numbers: Greenhouse Gas Data and International Climate Policy.” World Resources Institute (WRI). https://files.wri.org/d8/s3fs-public/pdf/navigating_numbers.pdf.
Bekos, M. A., D. J. C. Dekker, F. Frank, W. Meulemans, P. Rodgers, A. Schulz, and S. Wessel. 2022. “Computing Schematic Layouts for Spatial Hypergraphs on Concentric Circles and Grids.” Computer Graphics Forum 41 (6): 316–35. https://doi.org/10.1111/cgf.14497.
Bekos, Michael A., Henry Förster, Christian Geckeler, Lukas Holländer, Michael Kaufmann, Amadäus M. Spallek, and Jan Splett. 2018. “A Heuristic Approach Towards Drawings of Graphs with High Crossing Resolution.” In Lecture Notes in Computer Science, 271–85. Springer International Publishing. https://doi.org/10.1007/978-3-030-04414-5_19.
Bekos, Michael A., Michael Kaufmann, Katerina Potika, and Antonios Symvonis. 2007. “Line Crossing Minimization on Metro Maps.” In Graph Drawing, 231–42. Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-77537-9_24.
Bertault, François. 2000. “A Force-Directed Algorithm That Preserves Edge-Crossing Properties.” Information Processing Letters 74 (1-2): 7–13. https://doi.org/10.1016/s0020-0190(00)00042-9.
Bhatt, Sandeep N., and Frank Thomson Leighton. 1984. “A Framework for Solving VLSI Graph Layout Problems.” Journal of Computer and System Sciences 28 (2): 300–343. https://doi.org/10.1016/0022-0000(84)90071-0.
Bhore, Sujoy, Maarten Löffler, Soeren Nickel, and Martin Nöllenburg. 2021. “Unit Disk Representations of Embedded Trees, Outerplanar and Multi-Legged Graphs.” In Lecture Notes in Computer Science, 304–17. Springer International Publishing. https://doi.org/10.1007/978-3-030-92931-2_22.
Biedl, Therese, and Veronika Irvine. 2018. “Drawing Bobbin Lace Graphs, or, Fundamental Cycles for a Subclass of Periodic Graphs.” In Lecture Notes in Computer Science, 140–52. Springer International Publishing. https://doi.org/10.1007/978-3-319-73915-1_12.
Binucci, Carla, Markus Chimani, Walter Didimo, Giuseppe Liotta, and Fabrizio Montecchiani. 2016. “Placing Arrows in Directed Graph Drawings.” In Lecture Notes in Computer Science, 44–51. Springer International Publishing. https://doi.org/10.1007/978-3-319-50106-2_4.
Binucci, Carla, Walter Didimo, Michael Kaufmann, Giuseppe Liotta, and Fabrizio Montecchiani. 2022. “Placing Arrows in Directed Graph Layouts: Algorithms and Experiments.” Computer Graphics Forum 41 (1): 364–76. https://doi.org/10.1111/cgf.14440.
Binucci, Carla, Walter Didimo, and Maurizio Patrignani. 2023. “St-Orientations with Few Transitive Edges.” In Graph Drawing and Network Visualization, edited by Patrizio Angelini and Reinhard von Hanxleden, 201–16. Cham: Springer International Publishing. https://doi.org/10.1007/978-3-031-22203-0_15.
Binucci, Carla, Emilio Di Giacomo, Giuseppe Liotta, and Alessandra Tappini. 2021. “Quasi-Upward Planar Drawings with Minimum Curve Complexity.” In Lecture Notes in Computer Science, 195–209. Springer International Publishing. https://doi.org/10.1007/978-3-030-92931-2_14.
Börsig, Katharina, Ulrik Brandes, and Barna Pasztor. 2020. “Stochastic Gradient Descent Works Really Well for Stress Minimization.” In Lecture Notes in Computer Science, 18–25. Springer International Publishing. https://doi.org/10.1007/978-3-030-68766-3_2.
Brandes, Ulrik, and Boris Köpf. 2002. “Fast and Simple Horizontal Coordinate Assignment.” In Graph Drawing, edited by Petra Mutzel, Michael Jünger, and Sebastian Leipert, 31–44. Berlin, Heidelberg: Springer Berlin Heidelberg.
Brandes, Ulrik, and Christian Pich. 2006. “Eigensolver Methods for Progressive Multidimensional Scaling of Large Data.” In Proceedings of the 14th International Conference on Graph Drawing, 42–53. GD’06. Berlin, Heidelberg: Springer-Verlag. https://doi.org/10.5555/1758612.1758620.
Brandes, Ulrik, and Christıan Pich. 2009. “An Experimental Study on Distance-Based Graph Drawing.” In Graph Drawing, edited by Ioannis G. Tollis and Maurizio Patrignani, 218–29. Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-00219-9_21.
Brandes, Ulrik, and Dorothea Wagner. 1998. “Using Graph Layout to Visualize Train Interconnection Data.” In Graph Drawing, edited by Sue H. Whitesides, 44–56. Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-37623-2_4.
Buchheim, Christoph, Markus Chimani, Dietmar Ebner, Carsten Gutwenger, Michael Jünger, Gunnar W. Klau, Petra Mutzel, and René Weiskircher. 2008. “A Branch-and-Cut Approach to the Crossing Number Problem.” Discrete Optimization 5 (2): 373–88. https://doi.org/10.1016/j.disopt.2007.05.006.
Buchheim, Christoph, Dietmar Ebner, Michael Jünger, Gunnar W. Klau, Petra Mutzel, and René Weiskircher. 2006. “Exact Crossing Minimization.” In Graph Drawing, edited by Patrick Healy and Nikola S. Nikolov, 37–48. Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/11618058_4.
Buchin, K., B. Speckmann, and K. Verbeek. 2011. “Flow Map Layout via Spiral Trees.” IEEE Transactions on Visualization and Computer Graphics 17 (12): 2536–44. https://doi.org/10.1109/tvcg.2011.202.
Burch, H., and B. Cheswick. 1999. “Mapping the Internet.” Computer 32 (4): 97–98. https://doi.org/10.1109/2.755008.
Burch, M., M. Hlawatsch, and D. Weiskopf. 2017. “Visualizing a Sequence of a Thousand Graphs (or Even More).” Computer Graphics Forum 36 (3): 261–71. https://doi.org/10.1111/cgf.13185.
Burch, M., C. Vehlow, F. Beck, S. Diehl, and D. Weiskopf. 2011. “Parallel Edge Splatting for Scalable Dynamic Graph Visualization.” IEEE Transactions on Visualization and Computer Graphics 17 (12): 2344–53. https://doi.org/10.1109/tvcg.2011.226.
Calamoneri, Tiziana, Valentino Di Donato, Diego Mariottini, and Maurizio Patrignani. 2018. “Visualizing Co-Phylogenetic Reconciliations.” In Lecture Notes in Computer Science, 334–47. Springer International Publishing. https://doi.org/10.1007/978-3-319-73915-1_27.
Cao, Nan, D. Gotz, J. Sun, and Huamin Qu. 2011. “DICON: Interactive Visual Analysis of Multidimensional Clusters.” IEEE Transactions on Visualization and Computer Graphics 17 (12): 2581–90. https://doi.org/10.1109/tvcg.2011.188.
Castermans, Thom, Mereke van Garderen, Wouter Meulemans, Martin Nöllenburg, and Xiaoru Yuan. 2018. “Short Plane Supports for Spatial Hypergraphs.” In Lecture Notes in Computer Science, 53–66. Springer International Publishing. https://doi.org/10.1007/978-3-030-04414-5_4.
Chen, Fati, Laurent Piccinini, Pascal Poncelet, and Arnaud Sallaberry. 2019. “Node Overlap Removal Algorithms: A Comparative Study.” In Lecture Notes in Computer Science, 179–92. Springer International Publishing. https://doi.org/10.1007/978-3-030-35802-0_14.
Chevalier, Cédric, and François Pellegrini. 2008. “PT-Scotch: A tool for efficient parallel graph ordering.” Parallel Computing 34 (6-8): 318–31. https://doi.org/10.1016/j.parco.2007.12.001.
Chimani, Markus, and Carsten Gutwenger. 2012. “Advances in the Planarization Method: Effective Multiple Edge Insertions.” In Graph Drawing, 87–98. Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-25878-7_10.
Chimani, Markus, Carsten Gutwenger, and Petra Mutzel. 2006. “Experiments on Exact Crossing Minimization Using Column Generation.” In Experimental Algorithms, edited by Carme Àlvarez and María Serna, 303–15. Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/11764298_28.
Chimani, Markus, Carsten Gutwenger, Petra Mutzel, and Hoi-Ming Wong. 2010. “Layer-Free Upward Crossing Minimization.” ACM J. Exp. Algorithmics 15 (March). https://doi.org/10.1145/1671970.1671975.
Chimani, Markus, Max Ilsen, and Tilo Wiedera. 2021. “Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics.” In Lecture Notes in Computer Science, 41–56. Springer International Publishing. https://doi.org/10.1007/978-3-030-92931-2_3.
Chimani, Markus, Karsten Klein, and Tilo Wiedera. 2016. “A Note on the Practicality of Maximal Planar Subgraph Algorithms.” In Graph Drawing and Network Visualization, edited by Yifan Hu and Martin Nöllenburg, 357–64. Cham: Springer International Publishing.
Chimani, Markus, Petra Mutzel, and Immanuel Bomze. 2008. “A New Approach to Exact Crossing Minimization.” In Algorithms - ESA 2008, 284–96. Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-87744-8_24.
Chimani, Markus, and Tilo Wiedera. 2016a. “An ILP-based Proof System for the Crossing Number Problem.” In 24th Annual European Symposium on Algorithms (ESA 2016), edited by Piotr Sankowski and Christos Zaroliagis, 57:29:1–13. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.ESA.2016.29.
Chimani, Markus, and Tılo Wiedera. 2016b. “An ILP-Based Proof System for the Crossing Number Problem.” In 24th Annual European Symposium on Algorithms (ESA 2016), edited by Piotr Sankowski and Christos Zaroliagis, 57:29:1–13. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.ESA.2016.29.
Civril, Ali, Malik Magdon-Ismail, and Eli Bocek-Rivele. 2006. “SDE: Graph Drawing Using Spectral Distance Embedding.” In Graph Drawing, edited by Patrick Healy and Nikola S. Nikolov, 512–13. Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/11618058_48.
Clancy, Kieran, Michael Haythorpe, and Alex Newcombe. 2019a. “A Survey of Graphs with Known or Bounded Crossing Numbers.” Australas. J Comb. 78: 209–96. https://api.semanticscholar.org/CorpusID:119313173.
Clancy, Kieran, Mıchael Haythorpe, and Alex Newcombe. 2019b. “An Effective Crossing Minimisation Heuristic Based on Star Insertion.” Journal of Graph Algorithms and Applications 23 (2): 135–66. https://doi.org/10.7155/jgaa.00487.
Cohen, Jonathan D. 1997. “Drawing Graphs to Convey Proximity: An Incremental Arrangement Method.” ACM Transactions on Computer-Human Interaction 4 (3): 197–229. https://doi.org/10.1145/264645.264657.
Col, Philipp de, Fabian Klute, and Martin Nöllenburg. 2019. “Mixed Linear Layouts: Complexity, Heuristics, and Experiments.” In Lecture Notes in Computer Science, 460–67. Springer International Publishing. https://doi.org/10.1007/978-3-030-35802-0_35.
Cornel, D., A. Konev, B. Sadransky, Z. Horváth, A. Brambilla, I. Viola, and J. Waser. 2016. “Composite Flow Maps.” Computer Graphics Forum 35 (3): 461–70. https://doi.org/10.1111/cgf.12922.
Cui, Weiwei, Hong Zhou, Huamin Qu, Pak Chung Wong, and Xiaoming Li. 2008. “Geometry-Based Edge Clustering for Graph Visualization.” IEEE Transactions on Visualization and Computer Graphics 14 (6): 1277–84. https://doi.org/10.1109/TVCG.2008.135.
Cypko, M. A., J. Wojdziak, M. Stoehr, B. Kirchner, B. Preim, A. Dietz, H. U. Lemke, and S. Oeltze-Jafra. 2017. “Visual Verification of Cancer Staging for Therapy Decision Support.” Computer Graphics Forum 36 (3): 109–20. https://doi.org/10.1111/cgf.13172.
Dang, T. N., N. Pendar, and A. G. Forbes. 2016. “TimeArcs: Visualizing Fluctuations in Dynamic Networks.” Computer Graphics Forum 35 (3): 61–69. https://doi.org/10.1111/cgf.12882.
Davidson, Ron, and David Harel. 1996. “Drawing Graphs Nicely Using Simulated Annealing.” ACM Trans. Graph. 15 (4): 301–31. https://doi.org/10.1145/234535.234538.
Davis, Timothy A., and Yifan Hu. 2011. “The University of Florida Sparse Matrix Collection.” ACM Trans. Math. Softw. 38 (1). https://doi.org/10.1145/2049662.2049663.
De Luca, Felice, Emilio Di Giacomo, Walter Didimo, Stephen Kobourov, and Giuseppe Liotta. 2017. “An Experimental Study on the Ply Number of Straight-Line Drawings.” In WALCOM: Algorithms and Computation, edited by Sheung-Hung Poon, Md. Saidur Rahman, and Hsu-Chun Yen, 135–48. Cham: Springer International Publishing.
De Luca, Felice, Md. Iqbal Hossain, and Stephen Kobourov. 2019. “Symmetry Detection and Classification in Drawings of Graphs.” In Graph Drawing and Network Visualization, edited by Daniel Archambault and Csaba D. Tóth, 499–513. Cham: Springer International Publishing. https://doi.org/10.1007/978-3-030-35802-0_38.
Demel, Almut, Dominik Dürrschnabel, Tamara Mchedlidze, Marcel Radermacher, and Lasse Wulf. 2018. “A Greedy Heuristic for Crossing-Angle Maximization.” In Lecture Notes in Computer Science, 286–99. Springer International Publishing. https://doi.org/10.1007/978-3-030-04414-5_20.
Devkota, Sabin, Reyan Ahmed, Felice De Luca, Katherine E. Isaacs, and Stephen Kobourov. 2019. “Stress-Plus-x (SPX) Graph Layout.” In Lecture Notes in Computer Science, 291–304. Springer International Publishing. https://doi.org/10.1007/978-3-030-35802-0_23.
Devkota, Sabin, and Katherine E. Isaacs. 2018. “CFGExplorer: Designing a Visual Control Flow Analytics System Around Basic Program Analysis Operations.” Computer Graphics Forum 37 (3): 453–64. https://doi.org/10.1111/cgf.13433.
Di Bartolomeo, Sara, Tarik Crnovrsanin, David Saffo, Eduardo Puerta, Connor Wilson, and Cody Dunne. 2024. “Evaluating Graph Layout Algorithms: A Systematic Review of Methods and Best Practices.” Computer Graphics Forum n/a (n/a): e15073. https://doi.org/10.1111/cgf.15073.
Di Bartolomeo, Sara, Alexis Pister, Paolo Buono, Catherine Plaisant, Cody Dunne, and Jean-Daniel Fekete. 2022. “Six Methods for Transforming Layered Hypergraphs to Apply Layered Graph Layout Algorithms.” Computer Graphics Forum 41 (3): 259–70. https://doi.org/10.1111/cgf.14538.
Di Bartolomeo, Sara, Mirek Riedewald, Wolfgang Gatterbauer, and Cody Dunne. 2022. “STRATISFIMAL LAYOUT: A Modular Optimization Model for Laying Out Layered Node-Link Network Visualizations.” IEEE Transactions on Visualization and Computer Graphics 28 (1): 324–34. https://doi.org/10.1109/tvcg.2021.3114756.
Di Bartolomeo, Sara, Yixuan Zhang, Fangfang Sheng, and Cody Dunne. 2021. “Sequence Braiding: Visual Overviews of Temporal Event Sequences and Attributes.” IEEE Transactions on Visualization and Computer Graphics 27 (2): 1353–63. https://doi.org/10.1109/tvcg.2020.3030442.
Di Battista, Giuseppe, Ashim Garg, and Giuseppe Liotta. 1995. “An Experimental Comparison of Three Graph Drawing Algorithms (Extended Abstract).” In Proceedings of the Eleventh Annual Symposium on Computational Geometry, 306–15. SCG ’95. New York, NY, USA: Association for Computing Machinery. https://doi.org/10.1145/220279.220312.
Didimo, Walter, Luca Giamminonni, Giuseppe Liotta, Fabrizio Montecchiani, and Daniele Pagliuca. 2018. “A Visual Analytics System to Support Tax Evasion Discovery.” Decision Support Systems 110: 71–83. https://doi.org/10.1016/j.dss.2018.03.008.
Didimo, Walter, Giuseppe Liotta, and Fabrizio Montecchiani. 2019. “A Survey on Graph Drawing Beyond Planarity.” ACM Computing Surveys 52 (1): 1–37. https://doi.org/10.1145/3301281.
Didimo, Walter, Giuseppe Liotta, and Maurizio Patrignani. 2018. “Bend-Minimum Orthogonal Drawings in Quadratic Time.” In Lecture Notes in Computer Science, 481–94. Springer International Publishing. https://doi.org/10.1007/978-3-030-04414-5_34.
Dijk, Thomas C. van, Martin Fink, Norbert Fischer, Fabian Lipp, Peter Markfelder, Alexander Ravsky, Subhash Suri, and Alexander Wolff. 2016. “Block Crossings in Storyline Visualizations.” In Lecture Notes in Computer Science, 382–98. Springer International Publishing. https://doi.org/10.1007/978-3-319-50106-2_30.
Dijk, Thomas C. van, Fabian Lipp, Peter Markfelder, and Alexander Wolff. 2018. “Computing Storyline Visualizations with Few Block Crossings.” In Lecture Notes in Computer Science, 365–78. Springer International Publishing. https://doi.org/10.1007/978-3-319-73915-1_29.
Donati, Beatrice, Christian Baudet, Blerina Sinaimeri, Pierluigi Crescenzi, and Marie-France Sagot. 2015. “EUCALYPT: Efficient Tree Reconciliation Enumerator.” Algorithms for Molecular Biology 10: 3. https://doi.org/10.1186/s13015-014-0031-3.
Dwyer, Tim, Nathalie Henry Riche, Kim Marriott, and Christopher Mears. 2013. “Edge Compression Techniques for Visualization of Dense Directed Graphs.” IEEE Transactions on Visualization and Computer Graphics 19 (12): 2596–2605. https://doi.org/10.1109/tvcg.2013.151.
Eades, P. 1984. “A Heuristic for Graph Drawing.” Congressus Numerantium 42: 149–60. https://cir.nii.ac.jp/crid/1573387448853684864.
Eades, Peter, Quan Nguyen, and Seok-Hee Hong. 2018. “Drawing Big Graphs Using Spectral Sparsification.” In Lecture Notes in Computer Science, 272–86. Springer International Publishing. https://doi.org/10.1007/978-3-319-73915-1_22.
Elzen, Stef van den, Danny Holten, Jorik Blaas, and Jarke J. van Wijk. 2013. “Reordering Massive Sequence Views: Enabling Temporal and Structural Analysis of Dynamic Networks.” In 2013 IEEE Pacific Visualization Symposium (PacificVis). IEEE. https://doi.org/10.1109/pacificvis.2013.6596125.
Erdős, Paul, Alfréd Rényi, et al. 1960. “On the Evolution of Random Graphs.” Publ. Math. Inst. Hung. Acad. Sci 5 (1): 17–60.
Ersoy, O., C. Hurter, Fernando V. Paulovich, G. Cantareiro, and A. Telea. 2011. “Skeleton-Based Edge Bundling for Graph Visualization.” IEEE Transactions on Visualization and Computer Graphics 17 (12): 2364–73. https://doi.org/10.1109/tvcg.2011.233.
Feng, Wenzheng, Jie Tang, Tracy Xiao Liu, Shuhuai Zhang, and Jian Guan. 2019. “Understanding Dropouts in MOOCs.” In Proceedings of the 33rd AAAI Conference on Artificial Intelligence. https://doi.org/10.1609/aaai.v33i01.3301517.
Firman, Oksana, Philipp Kindermann, Alexander Ravsky, Alexander Wolff, and Johannes Zink. 2019. “Computing Height-Optimal Tangles Faster.” In Lecture Notes in Computer Science, 203–15. Springer International Publishing. https://doi.org/10.1007/978-3-030-35802-0_16.
Forster, Michael. 2002. “Applying Crossing Reduction Strategies to Layered Compound Graphs.” In Graph Drawing, edited by Michael T. Goodrich and Stephen G. Kobourov, 276–84. Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-36151-0_26.
Forster, Mıchael. 2005. “A Fast and Simple Heuristic for Constrained Two-Level Crossing Reduction.” In Graph Drawing, 206–16. Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-31843-9_22.
Förster, Henry, Michael Kaufmann, and Chrysanthi N. Raftopoulou. 2021. “Recognizing and Embedding Simple Optimal 2-Planar Graphs.” In Lecture Notes in Computer Science, 87–100. Springer International Publishing. https://doi.org/10.1007/978-3-030-92931-2_6.
Frick, Arne, Andreas Ludwig, and Heiko Mehldau. 1995. “A Fast Adaptive Layout Algorithm for Undirected Graphs (Extended Abstract and System Demonstration).” In Graph Drawing, edited by Roberto Tamassia and Ioannis G. Tollis, 388–403. Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-58950-3_393.
Frishman, Yaniv, and Ayellet Tal. 2007. “Multi-Level Graph Layout on the GPU.” IEEE Transactions on Visualization and Computer Graphics 13 (6): 1310–19. https://doi.org/10.1109/TVCG.2007.70580.
Frishman, Y., and A. Tal. 2008. “Online Dynamic Graph Drawing.” IEEE Transactions on Visualization and Computer Graphics 14 (4): 727–40. https://doi.org/10.1109/tvcg.2008.11.
Frishman, Y., and Ayellet Tal. 2004. “Dynamic Drawing of Clustered Graphs.” In IEEE Symposium on Information Visualization, 191–98. https://doi.org/10.1109/INFVIS.2004.18.
Fruchterman, Thomas M. J., and Edward M. Reingold. 1991. “Graph Drawing by Force-Directed Placement.” Software: Practice and Experience 21 (11): 1129–64. https://doi.org/10.1002/spe.4380211102.
Fulek, Radoslav, and Csaba D. Tóth. 2018. “Crossing Minimization in Perturbed Drawings.” In Lecture Notes in Computer Science, 229–41. Springer International Publishing. https://doi.org/10.1007/978-3-030-04414-5_16.
Gajer, Pawel, and Stephen G. Kobourov. 2000. “GRIP: Graph DRawing with Intelligent Placement.” In Proceedings of the 8th International Symposium on Graph Drawing, 222–28. GD ’00. Berlin, Heidelberg: Springer-Verlag. https://doi.org/10.5555/647552.729406.
Gange, Graeme, Peter J. Stuckey, and Kim Marriott. 2011. “Optimal k-Level Planarization and Crossing Minimization.” In Graph Drawing, 238–49. Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-18469-7_22.
Gansner, E. R., Yifan Hu, and S. North. 2013. “A Maxent-Stress Model for Graph Layout.” IEEE Transactions on Visualization and Computer Graphics 19 (6): 927–40. https://doi.org/10.1109/tvcg.2012.299.
Gansner, E. R., Y. Koren, and S. C. North. 2005. “Topological Fisheye Views for Visualizing Large Graphs.” IEEE Transactions on Visualization and Computer Graphics 11 (4): 457–68. https://doi.org/10.1109/tvcg.2005.66.
Gansner, E. R., E. Koutsofios, S. C. North, and K.-P. Vo. 1993. “A Technique for Drawing Directed Graphs.” IEEE Transactions on Software Engineering 19 (3): 214–30. https://doi.org/10.1109/32.221135.
Gansner, Emden R., and Yehuda Koren. 2006. “Improved Circular Layouts.” In Graph Drawing, 386–98. Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-70904-6_37.
Gansner, Emden R., Yehuda Koren, and Stephen North. 2005. “Graph Drawing by Stress Majorization.” In Graph Drawing, 239–50. Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-31843-9_25.
Gansner, Emden R., and Stephen C. North. 2000. “An Open Graph Visualization System and Its Applications to Software Engineering.” Softw. Pract. Exper. 30 (11): 1203–33.
Giacomo, Emilio Di, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, and Alessandra Tappini. 2020. “Storyline Visualizations with Ubiquitous Actors.” In Lecture Notes in Computer Science, 324–32. Springer International Publishing. https://doi.org/10.1007/978-3-030-68766-3_25.
Gibson, Helen, Joe Faith, and Paul Vickers. 2012. “A Survey of Two-Dimensional Graph Layout Techniques for Information Visualisation.” Information Visualization 12 (3-4): 324–57. https://doi.org/10.1177/1473871612455749.
Giovannangeli, Loann, Frederic Lalanne, David Auber, Romain Giot, and Romain Bourqui. 2021. “Deep Neural Network for DrawiNg Networks.” In Lecture Notes in Computer Science, 375–90. Springer International Publishing. https://doi.org/10.1007/978-3-030-92931-2_27.
Giovannangeli, Loann, Frederic Lalanne, Romain Giot, and Romain Bourqui. 2023. “FORBID: Fast Overlap Removal by Stochastic GradIent Descent for Graph Drawing.” In Graph Drawing and Network Visualization, edited by Patrizio Angelini and Reinhard von Hanxleden, 61–76. Cham: Springer International Publishing. https://doi.org/10.1007/978-3-031-22203-0_6.
Gove, R. 2019. “A Random Sampling o(n) Force-Calculation Algorithm for Graph Layouts.” Computer Graphics Forum 38 (3): 739–51. https://doi.org/10.1111/cgf.13724.
Grabowicz, Przemyslaw A, Luca Maria Aiello, and Filippo Menczer. 2014. “Fast Filtering and Animation of Large Dynamic Networks.” EPJ Data Science 3 (1). https://doi.org/10.1140/epjds/s13688-014-0027-8.
Gray, Kathryn, Mingwei Li, Reyan Ahmed, and Stephen Kobourov. 2023. “Visualizing Evolving Trees.” In Graph Drawing and Network Visualization, edited by Patrizio Angelini and Reinhard von Hanxleden, 319–35. Cham: Springer International Publishing. https://doi.org/10.1007/978-3-031-22203-0_23.
Greilich, Martin, Michael Burch, and Stephan Diehl. 2009. “Visualizing the Evolution of Compound Digraphs with TimeArcTrees.” Computer Graphics Forum 28 (3): 975–82. https://doi.org/10.1111/j.1467-8659.2009.01451.x.
Gronemann, Martin. 2016. “Bitonic St-Orderings for Upward Planar Graphs.” In Lecture Notes in Computer Science, 222–35. Springer International Publishing. https://doi.org/10.1007/978-3-319-50106-2_18.
Gronemann, Martin, Michael Jünger, Frauke Liers, and Francesco Mambelli. 2016. “Crossing Minimization in Storyline Visualization.” In Lecture Notes in Computer Science, 367–81. Springer International Publishing. https://doi.org/10.1007/978-3-319-50106-2_29.
Gutwenger, Carsten. 2010. “Application of SPQR-Trees in the Planarization Approach for Drawing Graphs.” PhD thesis, Technische Universität Dortmund. https://eldorado.tu-dortmund.de/handle/2003/27430.
Gutwenger, Carsten, and Petra Mutzel. 2004. “An Experimental Study of Crossing Minimization Heuristics.” In Graph Drawing, 13–24. Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-24595-7_2.
Hachul, Stefan, and Michael Juenger. 2005. “Large-Graph Layout with the Fast Multipole Multilevel Method.” Working Paper. Universität zu Köln. https://kups.ub.uni-koeln.de/54892/.
Hachul, Stefan, and Michael Jünger. 2005. “Drawing Large Graphs with a Potential-Field-Based Multilevel Algorithm.” In Graph Drawing, 285–95. Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-31843-9_29.
Hachul, Stefan, and Mıchael Jünger. 2006. “An Experimental Comparison of Fast Algorithms for Drawing General Large Graphs,” 235–50. https://doi.org/10.1007/11618058_22.
Harel, David, and Yehuda Koren. 2001. “A Fast Multi-Scale Method for Drawing Large Graphs.” In Graph Drawing, edited by Joe Marks, 183–96. Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-44541-2_18.
Heinsohn, Niklas, and Michael Kaufmann. 2018. “An Interactive Tool to Explore and Improve the Ply Number of Drawings.” In Lecture Notes in Computer Science, 38–51. Springer International Publishing. https://doi.org/10.1007/978-3-319-73915-1_4.
Henry, Nathalie, Jean-Daniel Fekete, and Michael J. McGuffin. 2007. “NodeTrix: A Hybrid Visualization of Social Networks.” IEEE Transactions on Visualization and Computer Graphics 13 (6): 1302–9. https://doi.org/10.1109/tvcg.2007.70582.
Heymann, S. 2009. “CPAN-Explorer, an Interactive Exploration of the Perl Ecosystem.” Gephi Blog. https://gephi.wordpress.com/2009/06/25/cpan-explorer-an-interactive-exploration-of-the-perl-ecosystem/.
Hoffswell, Jane, Alan Borning, and Jeffrey Heer. 2018. “SetCoLa: High-Level Constraints for Graph Layout.” Computer Graphics Forum 37 (3): 537–48. https://doi.org/10.1111/cgf.13440.
Hofmann, J., M. Größler, M. Rubio-Sánchez, P.-P. Pichler, and D. J. Lehmann. 2017. “Visual Exploration of Global Trade Networks with Time-Dependent and Weighted Hierarchical Edge Bundles on GPU.” Computer Graphics Forum 36 (3): 273–82. https://doi.org/10.1111/cgf.13186.
Holten, D. 2006. “Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data.” IEEE Transactions on Visualization and Computer Graphics 12 (5): 741–48. https://doi.org/10.1109/tvcg.2006.147.
Holten, Danny, and Jarke J. Van Wijk. 2009. “Force-Directed Edge Bundling for Graph Visualization.” Computer Graphics Forum 28 (3): 983–90. https://doi.org/10.1111/j.1467-8659.2009.01450.x.
Holten, Danny, and Jarke J. van Wijk. 2009. “Force-Directed Edge Bundling for Graph Visualization.” Computer Graphics Forum 28 (3): 983–90. https://doi.org/10.1111/j.1467-8659.2009.01450.x.
Hong, Seok-Hee, Peter Eades, Marnijati Torkel, Ziyang Wang, David Chae, Sungpack Hong, Daniel Langerenken, and Hassan Chafi. 2019. “Multi-Level Graph Drawing Using Infomap Clustering.” In Lecture Notes in Computer Science, 139–46. Springer International Publishing. https://doi.org/10.1007/978-3-030-35802-0_11.
Hu, Weihua, Matthias Fey, Marinka Zitnik, Yuxiao Dong, Hongyu Ren, Bowen Liu, Michele Catasta, and Jure Leskovec. 2020. “Open Graph Benchmark: Datasets for Machine Learning on Graphs.” In Proceedings of the 34th International Conference on Neural Information Processing Systems. NIPS ’20. Red Hook, NY, USA: Curran Associates Inc.
Hu, Y. F. 2005. “Efficient and High Quality Force-Directed Graph Drawing.” The Mathematica Journal 10: 37–71. http://www.mathematica-journal.com/issue/v10i1/contents/graph_draw/graph_draw.pdf.
Huang, Xiaoke, Ye Zhao, Chao Ma, Jing Yang, Xinyue Ye, and Chong Zhang. 2016. “TrajGraph: A Graph-Based Visual Analytics Approach to Studying Urban Network Centralities Using Taxi Trajectory Data.” IEEE Transactions on Visualization and Computer Graphics 22 (1): 160–69. https://doi.org/10.1109/tvcg.2015.2467771.
Hummel, Matthias, Fabian Klute, Soeren Nickel, and Martin Nöllenburg. 2019. “Maximizing Ink in Partial Edge Drawings of k-Plane Graphs.” In Lecture Notes in Computer Science, 323–36. Springer International Publishing. https://doi.org/10.1007/978-3-030-35802-0_25.
Isella, Lorenzo, Juliette Stehlé, Alain Barrat, Ciro Cattuto, Jean-François Pinton, and Wouter Van den Broeck. 2011. “What’s in a Crowd? Analysis of Face-to-Face Behavioral Networks.” Journal of Theoretical Biology 271 (1): 166–80. https://doi.org/10.1016/j.jtbi.2010.11.033.
Isenberg, Petra, Florian Heimerl, Steffen Koch, Tobias Isenberg, Panpan Xu, Chad Stolper, Michael Sedlmair, Jian Chen, Torsten Möller, and John Stasko. 2017. “Vispubdata.org: A Metadata Collection about IEEE Visualization (VIS) Publications.” IEEE Transactions on Visualization and Computer Graphics 23 (9): 2199–2206. https://doi.org/10.1109/TVCG.2016.2615308.
Jabrayilov, Adalat, Sven Mallach, Petra Mutzel, Ulf Rüegg, and Reinhard von Hanxleden. 2016. “Compact Layered Drawings of General Directed Graphs.” In Lecture Notes in Computer Science, 209–21. Springer International Publishing. https://doi.org/10.1007/978-3-319-50106-2_17.
Jacomy, Mathieu, Tommaso Venturini, Sebastien Heymann, and Mathieu Bastian. 2014. “ForceAtlas2, a Continuous Graph Layout Algorithm for Handy Network Visualization Designed for the Gephi Software.” Edited by Mark R. Muldoon. PLoS ONE 9 (6): e98679. https://doi.org/10.1371/journal.pone.0098679.
Jolly, Mitchell. 2017. “Chess Game Dataset (Lichess).” Kaggle. https://www.kaggle.com/datasets/datasnaek/chess?resource=download.
Jünger, Michael, and Petra Mutzel. 1996. “Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization.” In Graph Drawing, edited by Franz J. Brandenburg, 337–48. Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/BFb0021817.
Jünger, Michael, Petra Mutzel, and Christiane Spisla. 2018. “A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width.” In Lecture Notes in Computer Science, 187–99. Springer International Publishing. https://doi.org/10.1007/978-3-030-04414-5_13.
Kamada, Tomihisa, and Satoru Kawai. 1989. “An Algorithm for Drawing General Undirected Graphs.” Information Processing Letters 31 (1): 7–15. https://doi.org/10.1016/0020-0190(89)90102-6.
Kanehisa Laboratories. 2023. “KEGG Pathway Database.” Kyoto University. 2023. https://www.kegg.jp.
Kindermann, Philipp, Wouter Meulemans, and André Schulz. 2018. “Experimental Analysis of the Accessibility of Drawings with Few Segments.” Journal of Graph Algorithms and Applications 22 (3): 501–18. https://doi.org/10.7155/jgaa.00474.
Klammler, Moritz, Tamara Mchedlidze, and Alexey Pak. 2018. “Aesthetic Discrimination of Graph Layouts.” In Graph Drawing and Network Visualization, edited by Therese Biedl and Andreas Kerren, 169–84. Cham: Springer International Publishing. https://doi.org/10.1007/978-3-030-04414-5_12.
Klawitter, Jonathan, Tamara Mchedlidze, and Martin Nöllenburg. 2018. “Experimental Evaluation of Book Drawing Algorithms.” In Lecture Notes in Computer Science, 224–38. Springer International Publishing. https://doi.org/10.1007/978-3-319-73915-1_19.
Klawitter, Jonathan, and Johannes Zink. 2021. “Upward Planar Drawings with Three and More Slopes.” In Lecture Notes in Computer Science, 149–65. Springer International Publishing. https://doi.org/10.1007/978-3-030-92931-2_11.
Kleinberg, Jon. 2002. “The Structure of Information Networks.” https://www.cs.cornell.edu/courses/cs685/2002fa/.
Klemz, Boris, Kristin Knorr, Meghana M. Reddy, and Felix Schröder. 2021. “Simplifying Non-Simple Fan-Planar Drawings.” In Lecture Notes in Computer Science, 57–71. Springer International Publishing. https://doi.org/10.1007/978-3-030-92931-2_4.
Klimt, Bryan, and Yiming Yang. 2004. “Introducing the Enron Corpus.” In International Conference on Email and Anti-Spam.
Knuth, Donald Ervin. 2009. The Stanford Graphbase: A Platform for Combinatorial Computing. Addison-Wesley.
Koch, Thorsten, Alexander Martin, and Stefan Voß. 2001. “SteinLib: An Updated Library on Steiner Tree Problems in Graphs.” In Steiner Trees in Industry, edited by Xiu Zhen Cheng and Ding-Zhu Du, 285–325. Boston, MA: Springer US. https://doi.org/10.1007/978-1-4613-0255-1_9.
Koren, Y. 2005. “Drawing Graphs by Eigenvectors: Theory and Practice.” Computers & Mathematics with Applications 49 (11): 1867–88. https://doi.org/10.1016/j.camwa.2004.08.015.
Koren, Yehuda, L. Carmel, and D. Harel. 2002. “ACE: A Fast Multiscale Eigenvectors Computation for Drawing Huge Graphs.” In IEEE Symposium on Information Visualization, 2002. INFOVIS 2002., 137–44. https://doi.org/10.1109/INFVIS.2002.1173159.
Kruiger, J. F., P. E. Rauber, R. M. Martins, A. Kerren, S. Kobourov, and A. C. Telea. 2017. “Graph Layouts by t-SNE.” Computer Graphics Forum 36 (3): 283–94. https://doi.org/10.1111/cgf.13187.
Kunegis, Jérôme. 2013. “KONECT – The Koblenz Network Collection.” In Proc. Int. Conf. On World Wide Web Companion, 1343–50. http://dl.acm.org/citation.cfm?id=2488173.
Landesberger, Tatiana von, Felix Brodkorb, Philipp Roskosch, Natalia Andrienko, Gennady Andrienko, and Andreas Kerren. 2016. “MobilityGraphs: Visual Analysis of Mass Mobility Dynamics via Spatio-Temporal Graphs and Clustering.” IEEE Transactions on Visualization and Computer Graphics 22 (1): 11–20. https://doi.org/10.1109/tvcg.2015.2468111.
Leskovec, Jure, Lada A. Adamic, and Bernardo A. Huberman. 2007. “The Dynamics of Viral Marketing.” ACM Trans. Web 1 (1): 5–es. https://doi.org/10.1145/1232722.1232727.
Leskovec, Jure, Jon Kleinberg, and Christos Faloutsos. 2005. “Graphs over Time: Densification Laws, Shrinking Diameters and Possible Explanations.” In Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, 177–87. KDD ’05. New York, NY, USA: Association for Computing Machinery. https://doi.org/10.1145/1081870.1081893.
Leskovec, Jure, and Andrej Krevl. 2014. “SNAP Datasets: Stanford Large Network Dataset Collection.” http://snap.stanford.edu/data.
Letunic, Ivica, and Peer Bork. 2021. “Interactive Tree Of Life (iTOL) v5: an online tool for phylogenetic tree display and annotation.” Nucleic Acids Research 49 (W1): W293–96. https://doi.org/10.1093/nar/gkab301.
Lim, HeuiChan, and Stephen Kobourov. 2021. “Visualizing JIT Compiler Graphs.” In Lecture Notes in Computer Science, 138–46. Springer International Publishing. https://doi.org/10.1007/978-3-030-92931-2_10.
Lin, Yu-Ru, Jimeng Sun, Nan Cao, and Shixia Liu. 2010. “ContexTour: Contextual Contour Visual Analysis on Dynamic Multi-Relational Clustering.” In Proceedings of the 2010 SIAM International Conference on Data Mining. Society for Industrial; Applied Mathematics. https://doi.org/10.1137/1.9781611972801.37.
Liu, Mengchen, Jiaxin Shi, Zhen Li, Chongxuan Li, Jun Zhu, and Shixia Liu. 2017. “Towards Better Analysis of Deep Convolutional Neural Networks.” IEEE Transactions on Visualization and Computer Graphics 23 (1): 91–100. https://doi.org/10.1109/tvcg.2016.2598831.
Liu, Shixia, Yingcai Wu, Enxun Wei, Mengchen Liu, and Yang Liu. 2013. “StoryFlow: Tracking the Evolution of Stories.” IEEE Transactions on Visualization and Computer Graphics 19 (12): 2436–45. https://doi.org/10.1109/tvcg.2013.196.
Lukasczyk, Jonas, Gunther Weber, Ross Maciejewski, Christoph Garth, and Heike Leitte. 2017. “Nested Tracking Graphs.” Computer Graphics Forum 36 (3): 12–22. https://doi.org/10.1111/cgf.13164.
Maddison, David, Katja Schulz, and Wayne Maddison. 2007. “The Tree of Life Web Project*.” Zootaxa 1668 (December): 19–40. https://doi.org/10.11646/zootaxa.1668.1.4.
Mallach, Sven. 2019. “A Natural Quadratic Approach to the Generalized Graph Layering Problem.” In Lecture Notes in Computer Science, 532–44. Springer International Publishing. https://doi.org/10.1007/978-3-030-35802-0_40.
Malone, D. W. 1975. “An Introduction to the Application of Interpretive Structural Modeling.” Proceedings of the IEEE 63 (3): 397–404. https://doi.org/10.1109/PROC.1975.9765.
Marner, Michael R., Ross T. Smith, Bruce H. Thomas, Karsten Klein, Peter Eades, and Seok-Hee Hong. 2014. “GION: Interactively Untangling Large Graphs on Wall-Sized Displays.” In Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications, 113–24. Springer International Publishing. https://doi.org/10.1007/978-3-662-45803-7_10.
McAuley, Julian, and Jure Leskovec. 2012. “Learning to Discover Social Circles in Ego Networks.” In Proceedings of the 25th International Conference on Neural Information Processing Systems - Volume 1, 539–47. NIPS’12. Red Hook, NY, USA: Curran Associates Inc.
Meidiana, Amyra, Seok-Hee Hong, and Peter Eades. 2020. “New Quality Metrics for Dynamic Graph Drawing.” In Graph Drawing and Network Visualization, edited by David Auber and Pavel Valtr, 450–65. Cham: Springer International Publishing. https://doi.org/10.1007/978-3-030-68766-3_35.
Meidiana, Amyra, Seok-Hee Hong, Peter Eades, and Daniel Keim. 2019. “A Quality Metric for Visualization of Clusters in Graphs.” In Lecture Notes in Computer Science, 125–38. Springer International Publishing. https://doi.org/10.1007/978-3-030-35802-0_10.
Meidiana, Amyra, Seok-Hee Hong, Marnijati Torkel, Shijun Cai, and Peter Eades. 2020. “Sublinear Time Force Computation for Big Complex Network Visualization.” Computer Graphics Forum 39 (3): 579–91. https://doi.org/10.1111/cgf.14003.
Meidıana, Amyra, Seok-Hee Hong, and Peter Eades. 2023. “Shape-Faithful Graph Drawings.” In Graph Drawing and Network Visualization, edited by Patrizio Angelini and Reinhard von Hanxleden, 93–108. Cham: Springer International Publishing. https://doi.org/10.1007/978-3-031-22203-0_8.
Mennens, Robin J. P., Roeland Scheepens, and Michel A. Westenberg. 2019. “A Stable Graph Layout Algorithm for Processes.” Computer Graphics Forum 38 (3): 725–37. https://doi.org/10.1111/cgf.13723.
Meulemans, Wouter, Nathalie Henry Riche, Bettina Speckmann, Basak Alper, and Tim Dwyer. 2013. “KelpFusion: A Hybrid Set Visualization Technique.” IEEE Transactions on Visualization and Computer Graphics 19 (11): 1846–58. https://doi.org/10.1109/tvcg.2013.76.
Miller, Jacob, Vahan Huroyan, and Stephen Kobourov. 2023. “Spherical Graph Drawing by Multi-Dimensional Scaling.” In Graph Drawing and Network Visualization, edited by Patrizio Angelini and Reinhard von Hanxleden, 77–92. Cham: Springer International Publishing. https://doi.org/10.1007/978-3-031-22203-0_7.
Minghim, Rosane, Fernando Paulovich, and Alneu Lopes. 2006. “Content-Based Text Mapping Using Multi-Dimensional Projections for Exploration of Document Collections.” In Visualization and Data Analysis, 6060:60600S. https://doi.org/10.1117/12.650880.
Misue, Kazuo, and Katsuya Akasaka. 2019. “Graph Drawing with Morphing Partial Edges.” In Lecture Notes in Computer Science, 337–49. Springer International Publishing. https://doi.org/10.1007/978-3-030-35802-0_26.
Mizuno, Kazuyo, Hsiang-Yun Wu, Shigeo Takahashi, and Takeo Igarashi. 2019. “Optimizing Stepwise Animation in Dynamic Set Diagrams.” Computer Graphics Forum 38 (3): 13–24. https://doi.org/10.1111/cgf.13668.
Muelder, Chris, and Kwan Liu Ma. 2008a. “Rapid Graph Layout Using Space Filling Curves.” IEEE Transactions on Visualization and Computer Graphics 14 (6): 1301–8. https://doi.org/10.1109/TVCG.2008.158.
Muelder, Chris, and Kwan-Liu Ma. 2008b. “A Treemap Based Method for Rapid Layout of Large Graphs.” In 2008 IEEE Pacific Visualization Symposium, 231–38. https://doi.org/10.1109/PACIFICVIS.2008.4475481.
Nachmanson, Lev, Arlind Nocaj, Sergey Bereg, Leishi Zhang, and Alexander Holroyd. 2017. “Node Overlap Removal by Growing a Tree.” Journal of Graph Algorithms and Applications 21 (5): 857–72. https://doi.org/10.7155/jgaa.00442.
Ni, Chien-Chun, Yu-Yao Lin, Jie Gao, and Xianfeng Gu. 2018. “Network Alignment by Discrete Ollivier-Ricci Flow.” In Lecture Notes in Computer Science, 447–62. Springer International Publishing. https://doi.org/10.1007/978-3-030-04414-5_32.
Nickel, Soeren, Max Sondag, Wouter Meulemans, Markus Chimani, Stephen Kobourov, Jaakko Peltonen, and Martin Nöllenburg. 2019. “Computing Stable Demers Cartograms.” In Lecture Notes in Computer Science, 46–60. Springer International Publishing. https://doi.org/10.1007/978-3-030-35802-0_4.
Niedermann, Benjamin, and Ignaz Rutter. 2020. “An Integer-Linear Program for Bend-Minimization in Ortho-Radial Drawings.” In Lecture Notes in Computer Science, 235–49. Springer International Publishing. https://doi.org/10.1007/978-3-030-68766-3_19.
Noack, Andreas. 2004. “An Energy Model for Visual Graph Clustering.” In Graph Drawing, edited by Giuseppe Liotta, 425–36. Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-24595-7_40.
Nocaj, Arlind, Mark Ortmann, and Ulrik Brandes. 2015. “Untangling the Hairballs of Multi-Centered, Small-World Online Social Media Networks.” Journal of Graph Algorithms and Applications : JGAA 19 (2): 595–618. https://doi.org/10.7155/jgaa.00370.
Nollenburg, M, and A Wolff. 2011. “Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming.” IEEE Transactions on Visualization and Computer Graphics 17 (5): 626–41. https://doi.org/10.1109/tvcg.2010.81.
Nöllenburg, Martin. 2010. “An Improved Algorithm for the Metro-Line Crossing Minimization Problem.” In Graph Drawing, 381–92. Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-11805-0_36.
Nöllenburg, Martin, Anaïs Villedieu, and Jules Wulms. 2021. “Layered Area-Proportional Rectangle Contact Representations.” In Lecture Notes in Computer Science, 318–26. Springer International Publishing. https://doi.org/10.1007/978-3-030-92931-2_23.
North Dakota State University, and American Mathematical Society. 2006. “The Mathematics Genealogy Project.” United States: American Mathematical Society. https://genealogy.math.ndsu.nodak.edu/index.php.
Novák, Petr, Pavel Neumann, and Jiří Macas. 2010. “Graph-Based Clustering and Characterization of Repetitive Sequences in Next-Generation Sequencing Data.” BMC Bioinformatics 11 (1): 378. https://doi.org/10.1186/1471-2105-11-378.
Ogawa, Michael, and Kwan-Liu Ma. 2010. “Software Evolution Storylines.” In Proceedings of the 5th International Symposium on Software Visualization - SOFTVIS 10. ACM Press. https://doi.org/10.1145/1879211.1879219.
Oikonomou, Anargyros, and Antonios Symvonis. 2018. “Monotone Drawings of k-Inner Planar Graphs.” In Lecture Notes in Computer Science, 347–53. Springer International Publishing. https://doi.org/10.1007/978-3-030-04414-5_24.
Olszewski, Maya, Jeff Meder, Emmanuel Kieffer, Raphaël Bleuse, Martin Rosalie, Grégoire Danoy, and Pascal Bouvry. 2018. “Visualizing the Template of a Chaotic Attractor.” In Lecture Notes in Computer Science, 106–19. Springer International Publishing. https://doi.org/10.1007/978-3-030-04414-5_8.
Ortali, Giacomo, and Ioannis G. Tollis. 2018. “Algorithms and Bounds for Drawing Directed Graphs.” In Lecture Notes in Computer Science, 579–92. Springer International Publishing. https://doi.org/10.1007/978-3-030-04414-5_41.
Ortmann, Mark, Mirza Klimenta, and Ulrik Brandes. 2017. “A Sparse Stress Model.” Journal of Graph Algorithms and Applications 21 (5): 791–821. https://doi.org/10.7155/jgaa.00440.
Padia, Kalpesh, Kaveen Herath Bandara, and Christopher G. Healey. 2019. “A System for Generating Storyline Visualizations Using Hierarchical Task Network Planning.” Computers & Graphics 78 (February): 64–75. https://doi.org/10.1016/j.cag.2018.11.004.
Padia, Kalpesh, Kaveen Bandara, and Christopher Healey. 2018. “Yarn: Generating Storyline Visualizations Using HTN Planning.” Proceedings of Graphics Interface 2018 Toronto: 26–33. https://doi.org/10.20380/GI2018.05.
Palmer, Glenn, Roseanne W McManus, Vito D’Orazio, Michael R Kenwick, Mikaela Karstens, Chase Bloch, Nick Dietrich, Kayla Kahn, Kellan Ritter, and Michael J Soules. 2022. “The MID5 Dataset, 2011–2014: Procedures, Coding Rules, and Description.” Conflict Management and Peace Science 39 (4): 470–82. https://doi.org/10.1177/0738894221995743.
Pellegrini, François. 2012. “Scotch and PT-Scotch Graph Partitioning Software: An Overview.” In Combinatorial Scientific Computing, edited by Olaf Schenk Uwe Naumann, 373–406. Chapman and Hall/CRC. https://doi.org/10.1201/b11644-15.
Perri, Vincenzo, and Ingo Scholtes. 2020. “HOTVis: Higher-Order Time-Aware Visualisation of Dynamic Graphs.” In Lecture Notes in Computer Science, 99–114. Springer International Publishing. https://doi.org/10.1007/978-3-030-68766-3_8.
Preiner, R., J. Schmidt, K. Krösl, T. Schreck, and G. Mistelbauer. 2020. “Augmenting Node-Link Diagrams with Topographic Attribute Maps.” Computer Graphics Forum 39 (3): 369–81. https://doi.org/10.1111/cgf.13987.
Purchase, Helen C., Daniel Archambault, Stephen Kobourov, Martin Nöllenburg, Sergey Pupyrev, and Hsiang-Yun Wu. 2020. “The Turing Test for Graph Drawing Algorithms.” In Lecture Notes in Computer Science, 466–81. Springer International Publishing. https://doi.org/10.1007/978-3-030-68766-3_36.
Qu, Botong, Eugene Zhang, and Yue Zhang. 2022. “Automatic Polygon Layout for Primal-Dual Visualization of Hypergraphs.” IEEE Transactions on Visualization and Computer Graphics 28 (1): 633–42. https://doi.org/10.1109/tvcg.2021.3114759.
Raj, Mukund, and Ross T. Whitaker. 2018. “Anisotropic Radial Layout for Visualizing Centrality and Structure in Graphs.” In Lecture Notes in Computer Science, 351–64. Springer International Publishing. https://doi.org/10.1007/978-3-319-73915-1_28.
Red, Veronica, Eric D. Kelsic, Peter J. Mucha, and Mason A. Porter. 2011. “Comparing Community Structure to Characteristics in Online Collegiate Social Networks.” SIAM Review 53 (3): 526–43. https://doi.org/10.1137/080734315.
Rossi, Ryan A., and Nesreen K. Ahmed. 2015. “The Network Data Repository with Interactive Graph Analytics and Visualization.” In AAAI. http://networkrepository.com.
Rüegg, Ulf, Thorsten Ehlers, Miro Spönemann, and Reinhard von Hanxleden. 2016. “A Generalization of the Directed Graph Layering Problem.” In Lecture Notes in Computer Science, 196–208. Springer International Publishing. https://doi.org/10.1007/978-3-319-50106-2_16.
Saket, Bahador, Carlos Scheidegger, and Stephen Kobourov. 2016. “Comparing Node-Link and Node-Link-Group Visualizations from an Enjoyment Perspective.” Computer Graphics Forum 35 (3): 41–50. https://doi.org/10.1111/cgf.12880.
Sander, Georg. 1996. “Layout of Compound Directed Graphs.” FB INFORMATIK, UNIVERSITAT DES SAARLANDES.
Simonetto, Paolo, Daniel Archambault, and Stephen Kobourov. 2018. “Drawing Dynamic Graphs Without Timeslices.” In Lecture Notes in Computer Science, 394–409. Springer International Publishing. https://doi.org/10.1007/978-3-319-73915-1_31.
Skambath, Malte, and Till Tantau. 2016. “Offline Drawing of Dynamic Trees: Algorithmics and Document Integration.” In Lecture Notes in Computer Science, 572–86. Springer International Publishing. https://doi.org/10.1007/978-3-319-50106-2_44.
Soper, A. J., C. Walshaw, and M. Cross. 2004. “A Combined Evolutionary Search and Multilevel Optimisation Approach to Graph-Partitioning.” Journal of Global Optimization 29 (2): 225–41. https://doi.org/10.1023/B:JOGO.0000042115.44455.f3.
Subramanian, Arvind, and Shang-Jin Wei. 2007. “The WTO Promotes Trade, Strongly but Unevenly.” Journal of International Economics 72 (1): 151–75. https://doi.org/10.1016/j.jinteco.2006.07.007.
Sugiyama, Kozo, Shojiro Tagawa, and Mitsuhiko Toda. 1981. “Methods for Visual Understanding of Hierarchical System Structures.” IEEE Transactions on Systems, Man, and Cybernetics 11 (2): 109–25. https://doi.org/10.1109/tsmc.1981.4308636.
Tanahashi, Y., and Kwan-Liu Ma. 2012. “Design Considerations for Optimizing Storyline Visualizations.” IEEE Transactions on Visualization and Computer Graphics 18 (12): 2679–88. https://doi.org/10.1109/tvcg.2012.212.
Tanahashi, Yuzuru, Chien-Hsin Hsueh, and Kwan-Liu Ma. 2015. “An Efficient Framework for Generating Storyline Visualizations from Streaming Data.” IEEE Transactions on Visualization and Computer Graphics 21 (6): 730–42. https://doi.org/10.1109/tvcg.2015.2392771.
Traud, Amanda L., Peter J. Mucha, and Mason A. Porter. 2011. “Social Structure of Facebook Networks.” http://arxiv.org/abs/1102.2116.
Van De Bunt, Gerhard G., Marijtje A. J. Van Duijn, and Tom A. B. Snijders. 1999. “Friendship Networks Through Time: An Actor-Oriented Dynamic Statistical Network Model.” Computational & Mathematical Organization Theory 5 (2): 167–92. https://doi.org/10.1023/A:1009683123448.
Wallinger, Markus, Daniel Archambault, David Auber, Martin Nollenburg, and Jaakko Peltonen. 2022. “Edge-Path Bundling: A Less Ambiguous Edge Bundling Approach.” IEEE Transactions on Visualization and Computer Graphics 28 (1): 313–23. https://doi.org/10.1109/tvcg.2021.3114795.
Wallinger, Markus, Daniel Archambault, David Auber, Martin Nöllenburg, and Jaakko Peltonen. 2023. “Faster Edge-Path Bundling Through Graph Spanners.” Computer Graphics Forum n/a (n/a). https://doi.org/10.1111/cgf.14789.
Walshaw, C. 2001. “A Multilevel Algorithm for Force-Directed Graph Drawing.” In Graph Drawing, edited by Joe Marks, 171–82. Berlin, Heidelberg: Springer Berlin Heidelberg.
Walshaw, C., and M. Cross. 2000. “Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm.” SIAM J. Sci. Comput. 22 (1): 63–80. https://doi.org/10.1137/S1064827598337373.
Walter, Julian, Johannes Zink, Joachim Baumeister, and Alexander Wolff. 2020. “Layered Drawing of Undirected Graphs with Generalized Port Constraints.” In Lecture Notes in Computer Science, 220–34. Springer International Publishing. https://doi.org/10.1007/978-3-030-68766-3_18.
Wang, Yunhai, Yanyan Wang, Yinqi Sun, Lifeng Zhu, Kecheng Lu, Chi-Wing Fu, Michael Sedlmair, Oliver Deussen, and Baoquan Chen. 2018. “Revisiting Stress Majorization as a Unified Framework for Interactive Constrained Graph Visualization.” IEEE Transactions on Visualization and Computer Graphics 24 (1): 489–99. https://doi.org/10.1109/TVCG.2017.2745919.
Wang, Yunhai, Yanyan Wang, Haifeng Zhang, Yinqi Sun, Chi-Wing Fu, Michael Sedlmair, Baoquan Chen, and Oliver Deussen. 2019. “Structure-Aware Fisheye Views for Efficient Large Graph Exploration.” IEEE Transactions on Visualization and Computer Graphics 25 (1): 566–75. https://doi.org/10.1109/TVCG.2018.2864911.
Wang, Yunhai, Mingliang Xue, Yanyan Wang, Xinyuan Yan, Baoquan Chen, Chi-Wing Fu, and Christophe Hurter. 2020. “Interactive Structure-Aware Blending of Diverse Edge Bundling Visualizations.” IEEE Transactions on Visualization and Computer Graphics 26 (1): 687–96. https://doi.org/10.1109/TVCG.2019.2934805.
Welch, E., and S. Kobourov. 2017. “Measuring Symmetry in Drawings of Graphs.” Computer Graphics Forum 36 (3): 341–51. https://doi.org/10.1111/cgf.13192.
Wongsuphasawat, Kanit, Daniel Smilkov, James Wexler, Jimbo Wilson, Dandelion Mane, Doug Fritz, Dilip Krishnan, Fernanda B. Viegas, and Martin Wattenberg. 2018. “Visualizing Dataflow Graphs of Deep Learning Models in TensorFlow.” IEEE Transactions on Visualization and Computer Graphics 24 (1): 1–12. https://doi.org/10.1109/tvcg.2017.2744878.
Wu, Hsiang-Yun, Martin Nollenburg, and Ivan Viola. 2020. “Multi-Level Area Balancing of Clustered Graphs.” IEEE Transactions on Visualization and Computer Graphics, 1–1. https://doi.org/10.1109/tvcg.2020.3038154.
Wu, Jieting, Jianping Zeng, Feiyu Zhu, and Hongfeng Yu. 2018. “MLSEB: Edge Bundling Using Moving Least Squares Approximation.” In Lecture Notes in Computer Science, 379–93. Springer International Publishing. https://doi.org/10.1007/978-3-319-73915-1_30.
Xue, Mingliang, Zhi Wang, Fahai Zhong, Yong Wang, Mingliang Xu, Oliver Deussen, and Yunhai Wang. 2023. “Taurus: Towards a Unified Force Representation and Universal Solver for Graph Layout.” IEEE Transactions on Visualization and Computer Graphics 29 (1): 886–95. https://doi.org/10.1109/TVCG.2022.3209371.
Zachary, Wayne W. 1977. “An Information Flow Model for Conflict and Fission in Small Groups.” Journal of Anthropological Research 33 (4): 452–73. http://www.jstor.org/stable/3629752.
Zarate, David Cheng, Pierre Le Bodic, Tim Dwyer, Graeme Gange, and Peter Stuckey. 2018. “Optimal Sankey Diagrams via Integer Programming.” In 2018 IEEE Pacific Visualization Symposium (PacificVis), 135–39. https://doi.org/10.1109/PacificVis.2018.00025.
Zeng, W., Q. Shen, Y. Jiang, and A. Telea. 2019. “Route-Aware Edge Bundling for Visualizing Origin-Destination Trails in Urban Traffic.” Computer Graphics Forum 38 (3): 581–93. https://doi.org/10.1111/cgf.13712.
Zhang, Yonghe, and Yanyan Li. 2010. “BaryLayout: A Simple Algorithm for Fast Drawing Large Graphs.” In 2010 International Conference on Computational Intelligence and Software Engineering. IEEE. https://doi.org/10.1109/cise.2010.5677225.
Zhao, Ying, Haojin Jiang, Qian Chen, Yaqi Qin, Huixuan Xie, Yitao Wu, Shixia Liu, Zhiguang Zhou, Jiazhi Xia, and Fangfang Zhou. 2021. “Preserving Minority Structures in Graph Sampling.” IEEE Transactions on Visualization and Computer Graphics 27 (2): 1698–708. https://doi.org/10.1109/tvcg.2020.3030428.
Zheng, Jonathan X., Samraat Pawar, and Dan F. M. Goodman. 2019. “Graph Drawing by Stochastic Gradient Descent.” IEEE Transactions on Visualization and Computer Graphics 25 (9): 2738–48. https://doi.org/10.1109/TVCG.2018.2859997.
Zhong, Fahai, Mingliang Xue, Jian Zhang, Fan Zhang, Rui Ban, Oliver Deussen, and Yunhai Wang. 2023. “Force-Directed Graph Layouts Revisited: A New Force Based on the t-Distribution.” IEEE Transactions on Visualization and Computer Graphics, 1–14. https://doi.org/10.1109/TVCG.2023.3238821.
Zhu, Minfeng, Wei Chen, Yuanzhe Hu, Yuxuan Hou, Liangjun Liu, and Kaiyuan Zhang. 2021. “DRGraph: An Efficient Graph Layout Algorithm for Large-Scale Graphs by Dimensionality Reduction.” IEEE Transactions on Visualization and Computer Graphics 27 (2): 1666–76. https://doi.org/10.1109/TVCG.2020.3030447.