↓ 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 351 Three-dimensional graph drawing
  3. Altmetric Badge
    Chapter 352 3-D visualization of program information (extended abstract and system demonstration)
  4. Altmetric Badge
    Chapter 353 3D layout of reachability graphs of communicating processes
  5. Altmetric Badge
    Chapter 354 A flow approach to upward drawings of toroidal maps
  6. Altmetric Badge
    Chapter 355 Improved algorithms and bounds for orthogonal drawings
  7. Altmetric Badge
    Chapter 356 On bend-minimum orthogonal upward drawing of directed planar graphs
  8. Altmetric Badge
    Chapter 357 Grid layouts of block diagrams — bounding the number of bends in each connection (extended abstract)
  9. Altmetric Badge
    Chapter 358 On drawing a graph convexly in the plane (extended abstract)
  10. Altmetric Badge
    Chapter 359 On drawing angle graphs
  11. Altmetric Badge
    Chapter 360 Regular edge labelings and drawings of planar graphs
  12. Altmetric Badge
    Chapter 361 Minimum-width grid drawings of plane graphs extend abstract
  13. Altmetric Badge
    Chapter 362 Regular orientations, arboricity, and augmentation
  14. Altmetric Badge
    Chapter 363 The polyhedral approach to the maximum planar subgraph problem: New chances for related problems
  15. Altmetric Badge
    Chapter 364 Crossing numbers of graphs, lower bound techniques and algorithms: A survey
  16. Altmetric Badge
    Chapter 365 Graph-drawing contest report
  17. Altmetric Badge
    Chapter 366 Visibility graphs and oriented matroids (extended abstract)
  18. Altmetric Badge
    Chapter 367 Rectangle-visibility representations of bipartite graphs
  19. Altmetric Badge
    Chapter 368 On the number of directions in visibility representations of graphs (extended abstract)
  20. Altmetric Badge
    Chapter 369 Directed VR-representable graphs have unbounded dimension
  21. Altmetric Badge
    Chapter 370 GraphEd: A graphical platform for the implementation of graph algorithms (extended abstract and demo)
  22. Altmetric Badge
    Chapter 371 Graph layout through the VCG tool
  23. Altmetric Badge
    Chapter 372 Drawing telecommunication networks
  24. Altmetric Badge
    Chapter 373 Reduction of visual complexity in dynamic graphs
  25. Altmetric Badge
    Chapter 374 TOSCANA — A graphical tool for analyzing and exploring data
  26. Altmetric Badge
    Chapter 375 Characterization and recognition of point-halfspace and related orders
  27. Altmetric Badge
    Chapter 376 Redrawing a graph within a geometric tolerance
  28. Altmetric Badge
    Chapter 377 On the difficulty of embedding planar graphs with inaccuracies
  29. Altmetric Badge
    Chapter 378 A system for drawing graphs with geometric symmetry
  30. Altmetric Badge
    Chapter 379 Demonstration of the interactive graph visualization system da Vinci
  31. Altmetric Badge
    Chapter 380 CG: A graph drawing system using graph-grammar parsing
  32. Altmetric Badge
    Chapter 381 A demonstration of interactive graph based visual language applications
  33. Altmetric Badge
    Chapter 382 A simple algorithm for drawing large graphs on small screens
  34. Altmetric Badge
    Chapter 383 Molecular graph eigenvectors for molecular coordinates
  35. Altmetric Badge
    Chapter 384 On the computational complexity of upward and rectilinear planarity testing
  36. Altmetric Badge
    Chapter 385 Upward planarity testing of outerplanar dags (extended abstract)
  37. Altmetric Badge
    Chapter 386 Optimal-area upward drawings of AVL trees
  38. Altmetric Badge
    Chapter 387 Upward drawing on the plane grid using less ink
  39. Altmetric Badge
    Chapter 388 Proximity drawability: A survey extended abstract
  40. Altmetric Badge
    Chapter 389 Proximity constraints and representable trees (extended abstract)
  41. Altmetric Badge
    Chapter 390 Recognizing rectangle of influence drawable graphs (extended abstract)
  42. Altmetric Badge
    Chapter 391 A simple and unified method for drawing graphs: Magnetic-spring algorithm
  43. Altmetric Badge
    Chapter 392 Integration of declarative and algorithmic approaches for layout creation
  44. Altmetric Badge
    Chapter 393 A fast adaptive layout algorithm for undirected graphs (extended abstract and system demonstration)
  45. Altmetric Badge
    Chapter 394 Drawing graphs by example efficiently: Trees and planar acyclic digraphs (extended abstract)
  46. Altmetric Badge
    Chapter 395 Designing graph drawings by layout graph grammars
  47. Altmetric Badge
    Chapter 396 Encoding presentation emphasis algorithms for graphs
  48. Altmetric Badge
    Chapter 397 A practical approach to static node positioning
  49. Altmetric Badge
    Chapter 398 Map generalization as a graph drawing problem
  50. Altmetric Badge
    Chapter 399 A geometrical heuristic for drawing concept lattices
  51. Altmetric Badge
    Chapter 400 Poster gallery report
Attention for Chapter 384: On the computational complexity of upward and rectilinear planarity testing
Altmetric Badge

Mentioned by

wikipedia
8 Wikipedia pages

Citations

dimensions_citation
10 Dimensions

Readers on

mendeley
19 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
On the computational complexity of upward and rectilinear planarity testing
Chapter number 384
Book title
Graph Drawing
Published in
Lecture notes in computer science, October 1994
DOI 10.1007/3-540-58950-3_384
Book ISBNs
978-3-54-058950-1, 978-3-54-049155-2
Authors

Ashim Garg, Roberto Tamassia, Garg, Ashim, Tamassia, Roberto

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 19 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 4 21%
Researcher 4 21%
Student > Master 2 11%
Professor 1 5%
Unknown 8 42%
Readers by discipline Count As %
Computer Science 8 42%
Mathematics 2 11%
Physics and Astronomy 1 5%
Unknown 8 42%
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 17 October 2022.
All research outputs
#7,741,906
of 23,543,207 outputs
Outputs from Lecture notes in computer science
#2,493
of 8,139 outputs
Outputs of similar age
#6,618
of 22,378 outputs
Outputs of similar age from Lecture notes in computer science
#1
of 3 outputs
Altmetric has tracked 23,543,207 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,139 research outputs from this source. They typically receive a little more attention than average, with a mean Attention Score of 5.1. This one has gotten more attention than average, scoring higher than 54% 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 22,378 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 8th percentile – i.e., 8% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 3 others from the same source and published within six weeks on either side of this one. This one has scored higher than all of them