↓ 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 Planar Induced Subgraphs of Sparse Graphs
  3. Altmetric Badge
    Chapter 2 Picking Planar Edges; or, Drawing a Graph with a Planar Subgraph
  4. Altmetric Badge
    Chapter 3 Drawing Partially Embedded and Simultaneously Planar Graphs
  5. Altmetric Badge
    Chapter 4 Drawing Simultaneously Embedded Graphs with Few Bends
  6. Altmetric Badge
    Chapter 5 Planar and Quasi Planar Simultaneous Geometric Embedding
  7. Altmetric Badge
    Chapter 6 Simultaneous Embeddability of Two Partitions
  8. Altmetric Badge
    Chapter 7 Luatodonotes: Boundary Labeling for Annotations in Texts
  9. Altmetric Badge
    Chapter 8 A Coloring Algorithm for Disambiguating Graph and Map Drawings
  10. Altmetric Badge
    Chapter 9 Untangling Hairballs
  11. Altmetric Badge
    Chapter 10 GION: Interactively Untangling Large Graphs on Wall-Sized Displays
  12. Altmetric Badge
    Chapter 11 Balanced Circle Packings for Planar Graphs
  13. Altmetric Badge
    Chapter 12 Unit Contact Representations of Grid Subgraphs with Regular Polytopes in 2D and 3D
  14. Altmetric Badge
    Chapter 13 The Galois Complexity of Graph Drawing: Why Numerical Solutions Are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings
  15. Altmetric Badge
    Chapter 14 Bitonic st -orderings of Biconnected Planar Graphs
  16. Altmetric Badge
    Chapter 15 Drawing Outer 1-planar Graphs with Few Slopes
  17. Altmetric Badge
    Chapter 16 Fan-Planar Graphs: Combinatorial Properties and Complexity Results
  18. Altmetric Badge
    Chapter 17 On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs
  19. Altmetric Badge
    Chapter 18 Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth
  20. Altmetric Badge
    Chapter 19 A Crossing Lemma for the Pair-Crossing Number
  21. Altmetric Badge
    Chapter 20 Are Crossings Important for Drawing Large Graphs?
  22. Altmetric Badge
    Chapter 21 The Importance of Being Proper
  23. Altmetric Badge
    Chapter 22 Column Planarity and Partial Simultaneous Geometric Embedding
  24. Altmetric Badge
    Chapter 23 Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths
  25. Altmetric Badge
    Chapter 24 Disjoint Edges in Topological Graphs and the Tangled-Thrackle Conjecture
  26. Altmetric Badge
    Chapter 25 Morphing Schnyder Drawings of Planar Triangulations
  27. Altmetric Badge
    Chapter 26 Trade-Offs in Planar Polyline Drawings
  28. Altmetric Badge
    Chapter 27 Stress-Minimizing Orthogonal Layout of Data Flow Diagrams with Ports
  29. Altmetric Badge
    Chapter 28 Planar Octilinear Drawings with One Bend Per Edge
  30. Altmetric Badge
    Chapter 29 On the Complexity of HV-rectilinear Planarity Testing
  31. Altmetric Badge
    Chapter 30 Embedding Four-Directional Paths on Convex Point Sets
  32. Altmetric Badge
    Chapter 31 Drawing Graphs within Restricted Area
  33. Altmetric Badge
    Chapter 32 Height-Preserving Transformations of Planar Graph Drawings
  34. Altmetric Badge
    Chapter 33 Drawing Planar Graphs with Reduced Height
  35. Altmetric Badge
    Chapter 34 Anchored Drawings of Planar Graphs
  36. Altmetric Badge
    Chapter 35 Advances on Testing C-Planarity of Embedded Flat Clustered Graphs
  37. Altmetric Badge
    Chapter 36 Clustered Planarity Testing Revisited
  38. Altmetric Badge
    Chapter 37 A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem
  39. Altmetric Badge
    Chapter 38 MapSets: Visualizing Embedded and Clustered Graphs
  40. Altmetric Badge
    Chapter 39 Increasing-Chord Graphs On Point Sets
  41. Altmetric Badge
    Chapter 40 On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs
  42. Altmetric Badge
    Chapter 41 On Monotone Drawings of Trees
  43. Altmetric Badge
    Chapter 42 Graph Drawing Contest Report
Attention for Chapter 20: Are Crossings Important for Drawing Large Graphs?
Altmetric Badge

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
26 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
Are Crossings Important for Drawing Large Graphs?
Chapter number 20
Book title
Graph Drawing
Published by
Springer, Berlin, Heidelberg, September 2014
DOI 10.1007/978-3-662-45803-7_20
Book ISBNs
978-3-66-245802-0, 978-3-66-245803-7
Authors

Stephen G. Kobourov, Sergey Pupyrev, Bahador Saket, Kobourov, Stephen G., Pupyrev, Sergey, Saket, Bahador

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
United States 1 4%
France 1 4%
Unknown 24 92%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 7 27%
Student > Master 4 15%
Student > Bachelor 3 12%
Researcher 3 12%
Professor 1 4%
Other 2 8%
Unknown 6 23%
Readers by discipline Count As %
Computer Science 17 65%
Engineering 2 8%
Unknown 7 27%