The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Algorithms for drawing graphs: an annotated bibliography
Open accessAbstract
Several data presentation problems involve drawing graphs so that they are easy to read and understand. Examples include circuit schematics and diagrams for information systems analysis and design. In this paper we present a bibliographic survey on algorithms whose goal is to produce aesthetically pleasing drawings of graphs. Research on this topic is spread over the broad spectrum of computer science. This bibliography constitutes a first attempt to encompass both theoretical and application-oriented papers from disparate areas.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Booth, K. S., & Lueker, G. S. (1976) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(76)80045-1 · Cited by 1,488
Cited by
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
Graph embedding techniques, applications, and performance: A survey
Goyal, P., & Ferrara, E. (2018) · Knowledge-Based Systems · doi:10.1016/j.knosys.2018.03.022 · Cited by 1,801
Comorbidity: a network perspective
Cramer, A. O. J., Waldorp, L. J., van der Maas, H. L. J., & Borsboom, D. (2010) · Behavioral and Brain Sciences · doi:10.1017/s0140525x09991567 · Cited by 1,575
Recurrence based time series analysis by means of complex network methods
DONNER, R. V., SMALL, M., DONGES, J. F., MARWAN, N., ZOU, Y., XIANG, R., & KURTHS, J. (2011) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127411029021 · Cited by 423
Metadata
- Authors
- Battista, G. D., Eades, P., Tamassia, R., & Tollis, I. G.
- Venue
- Computational Geometry
- Publisher
- Elsevier BV
- Published
- 1994-10
- Volume
- 4
- Issue
- 5
- Pages
- 235-282
- ISSN
- 0925-7721 (ISSN-L)
- OpenAlex
- W1992709202
- Cited by
- 854
- References
- 1
- FWCI
- 115.76
- Type
- journal article
- Language
- en
- Open access
- bronze
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.
