↓ Skip to main content

Graph Drawing

Overview of attention for book
Cover of 'Graph Drawing'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 33 Bipartite embeddings of trees in the plane
  3. Altmetric Badge
    Chapter 34 Series-parallel planar ordered sets have pagenumber two
  4. Altmetric Badge
    Chapter 35 On rectangle visibility graphs
  5. Altmetric Badge
    Chapter 36 A graph drawing and translation service on the WWW
  6. Altmetric Badge
    Chapter 37 Drawing 2-, 3- and 4-colorable graphs in O(n 2 ) volume
  7. Altmetric Badge
    Chapter 38 Optimizing area and aspect ratio in straight-line orthogonal tree drawings
  8. Altmetric Badge
    Chapter 39 Drawing directed acyclic graphs: An experimental study
  9. Altmetric Badge
    Chapter 40 Circular layout in the Graph Layout toolkit
  10. Altmetric Badge
    Chapter 41 Multilevel visualization of clustered graphs
  11. Altmetric Badge
    Chapter 42 Straight-line drawing algorithms for hierarchical graphs and clustered graphs
  12. Altmetric Badge
    Chapter 43 Graph-Drawing contest report
  13. Altmetric Badge
    Chapter 44 Two algorithms for three dimensional orthogonal graph drawing
  14. Altmetric Badge
    Chapter 45 2-Visibility drawings of planar graphs
  15. Altmetric Badge
    Chapter 46 Upper bounds on the number of hidden nodes in Sugiyama's algorithm
  16. Altmetric Badge
    Chapter 47 Integration of declarative approaches (System Demonstration)
  17. Altmetric Badge
    Chapter 48 GIOTTO3D: A system for visualizing hierarchical structures in 3D
  18. Altmetric Badge
    Chapter 49 A new minimum cost flow algorithm with applications to graph drawing
  19. Altmetric Badge
    Chapter 50 Constrained graph layout
  20. Altmetric Badge
    Chapter 51 The graphlet system (system demonstration)
  21. Altmetric Badge
    Chapter 52 On the Edge Label Placement problem
  22. Altmetric Badge
    Chapter 53 Intersection graphs of noncrossing arc-connected sets in the plane
  23. Altmetric Badge
    Chapter 54 Wiring edge-disjoint layouts
  24. Altmetric Badge
    Chapter 55 Proximity drawings of outerplanar graphs (extended abstract)
  25. Altmetric Badge
    Chapter 56 Automatic visualization of two-dimensional cellular complexes
  26. Altmetric Badge
    Chapter 57 An alternative method to crossing minimization on hierarchical graphs
  27. Altmetric Badge
    Chapter 58 A linear-time algorithm for four-partitioning four-connected planar graphs
  28. Altmetric Badge
    Chapter 59 Graphs drawn with few crossings per edge
  29. Altmetric Badge
    Chapter 60 A pairing technique for area-efficient orthogonal drawings (extended abstract)
  30. Altmetric Badge
    Chapter 61 Experimental and theoretical results in interactive orthogonal graph drawing
  31. Altmetric Badge
    Chapter 62 An interactive system for drawing graphs
  32. Altmetric Badge
    Chapter 63 Automatic graph clustering (system demonstration)
  33. Altmetric Badge
    Chapter 64 Qualitative visualization of processes: Attributed graph layout and focusing techniques
Attention for Chapter 56: Automatic visualization of two-dimensional cellular complexes
Altmetric Badge

About this Attention Score

  • Average Attention Score compared to outputs of the same age and source

Mentioned by

q&a
1 Q&A thread

Citations

dimensions_citation
7 Dimensions

Readers on

mendeley
4 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
Automatic visualization of two-dimensional cellular complexes
Chapter number 56
Book title
Graph Drawing
Published in
Lecture notes in computer science, January 1997
DOI 10.1007/3-540-62495-3_56
Book ISBNs
978-3-54-062495-0, 978-3-54-068048-2
Authors

L. A. P. Lozada, C. F. X. de Mendonça, R. M. Rosi, J. Stolfi, Lozada, L. A. P., Mendonça, C. F. X. de, Rosi, R. M., Stolfi, J.

Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 4 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 4 100%

Demographic breakdown

Readers by professional status Count As %
Professor > Associate Professor 1 25%
Student > Bachelor 1 25%
Unknown 2 50%
Readers by discipline Count As %
Mathematics 1 25%
Computer Science 1 25%
Unknown 2 50%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 3. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 13 July 2011.
All research outputs
#12,849,499
of 22,655,397 outputs
Outputs from Lecture notes in computer science
#3,772
of 8,122 outputs
Outputs of similar age
#73,792
of 91,325 outputs
Outputs of similar age from Lecture notes in computer science
#13
of 20 outputs
Altmetric has tracked 22,655,397 research outputs across all sources so far. This one is in the 42nd percentile – i.e., 42% of other outputs scored the same or lower than it.
So far Altmetric has tracked 8,122 research outputs from this source. They receive a mean Attention Score of 5.0. This one has gotten more attention than average, scoring higher than 52% of its peers.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 91,325 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 18th percentile – i.e., 18% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 20 others from the same source and published within six weeks on either side of this one. This one is in the 30th percentile – i.e., 30% of its contemporaries scored the same or lower than it.