CoChat

Combining hierarchy and energy for drawing directed graphs

Carmel, L., Harel, D., Koren, Y. · 2004 · IEEE Transactions on Visualization and Computer Graphics

The DOI matches its Crossref record; 23 of the 24 references it cites were found in a registry or an index.

Abstract

We present an algorithm for drawing directed graphs which is based on rapidly solving a unique one-dimensional optimization problem for each of the axes. The algorithm results in a clear description of the hierarchy structure of the graph. Nodes are not restricted to lie on fixed horizontal layers, resulting in layouts that convey the symmetries of the graph very naturally. The algorithm can be applied without change to cyclic or acyclic digraphs and even to graphs containing both directed and undirected edges. We also derive a hierarchy index from the input digraph, which quantitatively measures its amount of hierarchy.

Overview

Integrity signals

Registry

Crossref · 10.1109/tvcg.2004.1260757

Cites

23 of 23 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Citations

Cites

Show all 23 references

Research works printed but not linked: 1

  1. 2003, The Matrix Market collection

Cited by

See all 34

Metadata

Authors
Carmel, L., Harel, D., & Koren, Y.
Affiliations
  • Weizmann Institute of Science (IL)
  • AT&T (United States) (US)
Venue
IEEE Transactions on Visualization and Computer Graphics
Published
2004-01
Volume
10
Issue
1
Pages
46-57
ISSN
1077-2626 (ISSN-L)
OpenAlex
W2156458358
Cited by
34
References
24
Citations by year
2026: 1 · 2025: 2 · 2024: 1 · 2023: 4 · 2022: 2 · 2021: 1 · 2019: 1 · 2017: 1 · 2015: 1 · 2014: 1 · 2013: 2
FWCI
3.75
Type
journal article
Language
en
Open access
closed
Locations
  • IEEE Transactions on Visualization and Computer Graphics (publishedVersion)
  • PubMed (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Computer Graphics and Computer-Aided Design › Data Visualization and Analytics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Graph Theory and Algorithms
  • Physical Sciences › Computer Science › Computer Graphics and Computer-Aided Design › Computer Graphics and Visualization Techniques
Keywords
graph layout algorithms, graph hierarchy, energy minimization, one-dimensional optimization, acyclic digraphs, graph symmetry
MeSH terms
Algorithms, Computer Graphics, Image Enhancement, Image Interpretation, Computer-Assisted, Paintings, Pattern Recognition, Automated, Signal Processing, Computer-Assisted, User-Computer Interface, Imaging, Three-Dimensional

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Combining hierarchy and energy for drawing directed graphs. https://app.cochat.ai/papers/10.1109/tvcg.2004.1260757
The paper
Carmel, L., Harel, D., & Koren, Y. (2004). Combining hierarchy and energy for drawing directed graphs. IEEE Transactions on Visualization and Computer Graphics. https://doi.org/10.1109/tvcg.2004.1260757

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.