The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings. Bannister, M. J., Devanny, W. E., Eppstein, D., & Goodrich, M. T. J. Graph Algorithms Appl., 19(2):619-656, 2015.
The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings. [link]Link  The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings. [link]Paper  bibtex   
@article{journals/jgaa/BannisterDEG15,
  added-at = {2015-12-03T00:00:00.000+0100},
  author = {Bannister, Michael J. and Devanny, William E. and Eppstein, David and Goodrich, Michael T.},
  biburl = {http://www.bibsonomy.org/bibtex/2a323dabde2ae26c6adc4bbd35d5500b7/dblp},
  ee = {http://dx.doi.org/10.7155/jgaa.00349},
  interhash = {0ccf8c55f1edfec415efb4b1e79cc271},
  intrahash = {a323dabde2ae26c6adc4bbd35d5500b7},
  journal = {J. Graph Algorithms Appl.},
  keywords = {dblp},
  number = 2,
  pages = {619-656},
  timestamp = {2015-12-04T11:34:44.000+0100},
  title = {The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings.},
  url = {http://dblp.uni-trier.de/db/journals/jgaa/jgaa19.html#BannisterDEG15},
  volume = 19,
  year = 2015
}

Downloads: 0