OpenOrd: an open-source toolbox for large graph layout
By Shawn Martin, W. M. Brown, Richard Klavans, Kevin W. Boyack, White Horse. 2011
325 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Computer Vision and Pattern Recognition, Statistical and Nonlinear Physics
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
- Tommaso Venturini
- Paul Vickers
- Helen Gibson
- Joe Faith
- Mathieu Jacomy
- Sebastien Heymann
- Mathieu Bastian
- Peter Bhlmann
In Computer Vision and Pattern Recognition
- Tommaso Venturini
- Paul Vickers
- Helen Gibson
- Joe Faith
- Mathieu Jacomy
- Sebastien Heymann
- Mathieu Bastian
- Richard Klavans
In Statistical and Nonlinear Physics
- Tommaso Venturini
- Paul Vickers
- Helen Gibson
- Joe Faith
- Mathieu Jacomy
- Sebastien Heymann
- Mathieu Bastian
- Kevin W. Boyack
Citations in the corpus
- ForceAtlas2, a Continuous Graph Layout Algorithm for Handy Network Visualization Designed for the Gephi Software (2014, methodology): “Phased strategies, used for example by OpenOrd [8], are by definition incompatible, even if in this case it allows OpenOrd to spatialize much larger networks.”
- Which Type of Citation Analysis Generates the Most Accurate Taxonomy of Scientific and Technical Knowledge? (2015, methodology): “…VxOrd algorithm from Sandia National Laboratories (Davidson, Wylie, & Boyack, 2001), which had originally handled only tens of thousands of nodes, was revamped (and renamed to DrL, and then to OpenOrd) to where it was capable of clustering millions of nodes (Martin, Brown, Klavans, & Boyack, 2011).”
- Graph Wavelet Neural Network (2019, background): “These nodes are clustered by OpenOrd (Martin et al., 2011) based on the adjacency matrix.”
- A survey of two-dimensional graph layout techniques for information visualisation (2013, methodology): “They also concede that the algorithm was coded for functionality rather than performance; consequently, the algorithm is often not used practically because it is too slow to be deemed useful.19 Exceptions to this are from Li and Kurata,33 who implemented it in their CADLIVE system for laying out bio”
- From Local to Global: A Graph RAG Approach to Query-Focused Summarization (2024, methodology): “Node layout was performed via OpenORD (Martin et al., 2011) and Force Atlas 2 (Jacomy et al., 2014).”
- Comprehensive and Integrated Genomic Characterization of Adult Soft Tissue Sarcomas. (2017, unknown): “…al., 2015 RRID:SCR_005183; https://www.broadinstitute.org/ cancer/cga/oncotator NMF Gaujoux and Seoighe, 2010 https://cran.r-project.org/package=NMF OpenOrd Martin et al., 2011 http://www.sandia.gov/ smartin/software.html PARADIGM Sedgewick et al., 2013 http://sbenz.github.io/Paradigm pHeatmap v1.”
- ForceAtlas 2 , A Continuous Graph Layout Algorithm for Handy Network Visualization (2012, methodology): “Phased strategies, used for example by OpenOrd [8], are by definition incompatible, even if in this case it allows OpenOrd to spatialize much larger networks.”
- On the Origins of Memes by Means of Fringe Web Communities (2018, methodology): “NB: the graph is laid out using the OpenOrd algorithm [63] and the distance between the components in it does not exactly match the actual distance metric.”
- Handbook of Big Data (2016, background): “There is no shortage of graph layout ideas that proclaim to visualize large graphs [75,76].”
- Tweeting From Left to Right (2015, methodology): “Then, we use the OpenOrd layout algorithm (Martin et al., 2011), a variant of force-directed layout algorithms such as the Fruchterman-Reingold algorithm (Fruchterman and Reingold, 1991) that can scale to a large number of nodes.”