The DOI matches its Crossref record.
Methods for Visual Understanding of Hierarchical System Structures
Abstract
Two kinds of new methods are developed to obtain effective representations of hierarchies automatically: theoretical and heuristic methods. The methods determine the positions of vertices in two steps. First the order of the vertices in each level is determined to reduce the number of crossings of edges. Then horizontal positions of the vertices are determined to improve further the readability of drawings. The theoretical methods are useful in recognizing the nature of the problem, and the heuristic methods make it possible to enlarge the size of hierarchies with which we can deal. Performance tests of the heuristic methods and several applications are presented.
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
Cited by
Clustering trees: a visualization for evaluating clusterings at multiple resolutions
Zappia, L., & Oshlack, A. (2018) · GigaScience · doi:10.1093/gigascience/giy083 · Cited by 1,064
A Race-Track Trapped-Ion Quantum Processor
Moses, S. A., Baldwin, C. H., Allman, M. S., Ancona, R., Ascarrunz, L., Barnes, C., Bartolotta, J., Bjork, B., Blanchard, P., Bohn, M., et al. (2023) · Physical Review X · doi:10.1103/physrevx.13.041052 · Cited by 391
Hierarchy Measure for Complex Networks
Mones, E., Vicsek, L., & Vicsek, T. (2012) · PLoS ONE · doi:10.1371/journal.pone.0033799 · Cited by 259
Combining hierarchy and energy for drawing directed graphs
Carmel, L., Harel, D., & Koren, Y. (2004) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2004.1260757 · Cited by 34
Brown, N. C., Campora, J. P., Granade, C., Heim, B., Wernli, S., Ryan-Anderson, C., Lucchetti, D., Paetznick, A., Roetteler, M., Svore, K., et al. (2023) · arXiv · doi:10.48550/arxiv.2310.12106 · Cited by 4
Metadata
- Authors
- Sugiyama, K., Tagawa, S., & Toda, M.
- Venue
- IEEE Transactions on Systems, Man, and Cybernetics
- Published
- 1981
- Volume
- 11
- Issue
- 2
- Pages
- 109-125
- ISSN
- 0018-9472 (ISSN-L)
- OpenAlex
- W2071353749
- Cited by
- 1,223
- References
- 0
- FWCI
- 3.18
- Type
- journal article
- Language
- en
- Open access
- closed
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.
