The DOI matches its OpenAlex record; 1 of the 1 references it cites were found in a registry or an index.
A fast adaptive layout algorithm for undirected graphs
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Graph drawing by force‐directed placement
Fruchterman, T. M. J., & Reingold, E. M. (1991) · Software: Practice and Experience · doi:10.1002/spe.4380211102 · Cited by 6,352
Cited by
Jacomy, M., Venturini, T., Heymann, S., & Bastian, M. (2014) · PLoS ONE · doi:10.1371/journal.pone.0098679 · Cited by 2,909
Graph visualization and navigation in information visualization: A survey
Herman, I., Melancon, G., & Marshall, M. S. (2000) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/2945.841119 · Cited by 1,538
Visual Analysis of Large Graphs: State‐of‐the‐Art and Future Research Challenges
von Landesberger, T., Kuijper, A., Schreck, T., Kohlhammer, J., van Wijk, J. J., Fekete, J. ‐., & Fellner, D. W. (2011) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2011.01898.x · Cited by 515
Metrics for Graph Drawing Aesthetics
Purchase, H. C. (2002) · Journal of Visual Languages & Computing · doi:10.1006/jvlc.2002.0232 · Cited by 311
Geometry-Based Edge Clustering for Graph Visualization
Cui, W., Zhou, H., Qu, H., Wong, P. C., & Li, X. (2008) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2008.135 · Cited by 283
Metadata
- Authors
- Frick, A., Mehldau, H., & Ludwig, A.
- Venue
- Repository KITopen (Karlsruhe Institute of Technology)
- Publisher
- Karlsruhe Institute of Technology
- Published
- 1994-01-01
- OpenAlex
- W1503013560
- Cited by
- 223
- References
- 1
- FWCI
- 9.49
- Type
- book chapter
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.