"The Galois Complexity of Graph Drawing: Why Numerical Solutions are ..."

Michael J. Bannister et al. (2015)

> Home

Details and statistics

DOI: 10.7155/JGAA.00349

access: open

type: Journal Article

metadata version: 2021-02-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jgaa/BannisterDEG15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgaa/BannisterDEG15
Michael J. Bannister, William E. Devanny, David Eppstein, Michael T. Goodrich:
The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings. J. Graph Algorithms Appl. 19(2): 619-656 (2015)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.