↓ 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 1 Graph Drawing
  3. Altmetric Badge
    Chapter 2 Morphing Planar Graphs While Preserving Edge Directions
  4. Altmetric Badge
    Chapter 3 Dynamic Spectral Layout of Small Worlds
  5. Altmetric Badge
    Chapter 4 Exact Crossing Minimization
  6. Altmetric Badge
    Chapter 5 On Embedding a Cycle in a Plane Graph
  7. Altmetric Badge
    Chapter 6 On Rectilinear Duals for Vertex-Weighted Plane Graphs
  8. Altmetric Badge
    Chapter 7 Bar k-Visibility Graphs: Bounds on the Number of Edges, Chromatic Number, and Thickness
  9. Altmetric Badge
    Chapter 8 Drawing K n in Three Dimensions with One Bend Per Edge
  10. Altmetric Badge
    Chapter 9 Small Area Drawings of Outerplanar Graphs
  11. Altmetric Badge
    Chapter 10 Volume Requirements of 3D Upward Drawings
  12. Altmetric Badge
    Chapter 11 How to Embed a Path onto Two Sets of Points
  13. Altmetric Badge
    Chapter 12 Upward Spirality and Upward Planarity Testing
  14. Altmetric Badge
    Chapter 13 Graph Treewidth and Geometric Thickness Parameters
  15. Altmetric Badge
    Chapter 14 Stress Majorization with Orthogonal Ordering Constraints
  16. Altmetric Badge
    Chapter 15 Fast Node Overlap Removal
  17. Altmetric Badge
    Chapter 16 Delta-Confluent Drawings
  18. Altmetric Badge
    Chapter 17 Transversal Structures on Triangulations, with Application to Straight-Line Drawing
  19. Altmetric Badge
    Chapter 18 A Hybrid Model for Drawing Dynamic and Evolving Graphs
  20. Altmetric Badge
    Chapter 19 Two Trees Which Are Self–intersecting When Drawn Simultaneously
  21. Altmetric Badge
    Chapter 20 C-Planarity of Extrovert Clustered Graphs
  22. Altmetric Badge
    Chapter 21 Non-planar Core Reduction of Graphs
  23. Altmetric Badge
    Chapter 22 An Experimental Comparison of Fast Algorithms for Drawing General Large Graphs
  24. Altmetric Badge
    Chapter 23 Hierarchical Layouts of Directed Graphs in Three Dimensions
  25. Altmetric Badge
    Chapter 24 Graph Drawing
  26. Altmetric Badge
    Chapter 25 On Edges Crossing Few Other Edges in Simple Topological Complete Graphs
  27. Altmetric Badge
    Chapter 26 On Balloon Drawings of Rooted Trees
  28. Altmetric Badge
    Chapter 27 Convex Drawings of Plane Graphs of Minimum Outer Apices
  29. Altmetric Badge
    Chapter 28 Energy-Based Clustering of Graphs with Nonuniform Degrees
  30. Altmetric Badge
    Chapter 29 A Mixed-Integer Program for Drawing High-Quality Metro Maps
  31. Altmetric Badge
    Chapter 30 Crossing Number of Toroidal Graphs
  32. Altmetric Badge
    Chapter 31 Drawing Graphs Using Modular Decomposition
  33. Altmetric Badge
    Chapter 32 Applications of Parameterized st-Orientations in Graph Drawing Algorithms
  34. Altmetric Badge
    Chapter 33 Complexity Results for Three-Dimensional Orthogonal Graph Drawing
  35. Altmetric Badge
    Chapter 34 On Extending a Partial Straight-Line Drawing
  36. Altmetric Badge
    Chapter 35 Odd Crossing Number Is Not Crossing Number
  37. Altmetric Badge
    Chapter 36 Minimum Depth Graph Embeddings and Quality of the Drawings: An Experimental Analysis
  38. Altmetric Badge
    Chapter 37 No-bend Orthogonal Drawings of Series-Parallel Graphs
  39. Altmetric Badge
    Chapter 38 Parallel-Redrawing Mechanisms, Pseudo-Triangulations and Kinetic Planar Graphs
  40. Altmetric Badge
    Chapter 39 Proper and Planar Drawings of Graphs on Three Layers
  41. Altmetric Badge
    Chapter 40 Incremental Connector Routing
  42. Altmetric Badge
    Chapter 41 An Application of Well-Orderly Trees in Graph Drawing
  43. Altmetric Badge
    Chapter 42 GEOMI: GEOmetry for Maximum Insight
  44. Altmetric Badge
    Chapter 43 WhatsOnWeb: Using Graph Drawing to Search the Web
  45. Altmetric Badge
    Chapter 44 Drawing Clustered Graphs in Three Dimensions
  46. Altmetric Badge
    Chapter 45 BLer: A Boundary Labeller for Technical Drawings
  47. Altmetric Badge
    Chapter 46 D-Dupe: An Interactive Tool for Entity Resolution in Social Networks
  48. Altmetric Badge
    Chapter 47 A New Method for Efficiently Generating Planar Graph Visibility Representations
  49. Altmetric Badge
    Chapter 48 SDE: Graph Drawing Using Spectral Distance Embedding
  50. Altmetric Badge
    Chapter 49 MultiPlane: A New Framework for Drawing Graphs in Three Dimensions
  51. Altmetric Badge
    Chapter 50 Visualizing Graphs as Trees: Plant a Seed and Watch it Grow
  52. Altmetric Badge
    Chapter 51 On Straightening Low-Diameter Unit Trees
  53. Altmetric Badge
    Chapter 52 Mixed Upward Planarization – Fast and Robust
  54. Altmetric Badge
    Chapter 53 Network Analysis and Visualisation
  55. Altmetric Badge
    Chapter 54 Graph-Drawing Contest Report
  56. Altmetric Badge
    Chapter 55 Minimum Cycle Bases and Surface Reconstruction
  57. Altmetric Badge
    Chapter 56 Hierarchy Visualization: From Research to Practice
Attention for Chapter 31: Drawing Graphs Using Modular Decomposition
Altmetric Badge

About this Attention Score

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

Mentioned by

wikipedia
2 Wikipedia pages

Citations

dimensions_citation
3 Dimensions

Readers on

mendeley
5 Mendeley
citeulike
5 CiteULike
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
Drawing Graphs Using Modular Decomposition
Chapter number 31
Book title
Graph Drawing
Published in
Lecture notes in computer science, September 2005
DOI 10.1007/11618058_31
Book ISBNs
978-3-54-031425-7, 978-3-54-031667-1
Authors

Charis Papadopoulos, Constantinos Voglis

Editors

Patrick Healy, Nikola S. Nikolov

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 5 100%

Demographic breakdown

Readers by professional status Count As %
Researcher 2 40%
Student > Master 1 20%
Unknown 2 40%
Readers by discipline Count As %
Computer Science 2 40%
Unknown 3 60%
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 03 March 2019.
All research outputs
#7,454,951
of 22,790,780 outputs
Outputs from Lecture notes in computer science
#2,486
of 8,127 outputs
Outputs of similar age
#20,472
of 58,748 outputs
Outputs of similar age from Lecture notes in computer science
#9
of 53 outputs
Altmetric has tracked 22,790,780 research outputs across all sources so far. This one is in the 44th percentile – i.e., 44% of other outputs scored the same or lower than it.
So far Altmetric has tracked 8,127 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 55% 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 58,748 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 14th percentile – i.e., 14% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 53 others from the same source and published within six weeks on either side of this one. This one is in the 35th percentile – i.e., 35% of its contemporaries scored the same or lower than it.