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.
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
{"_id":"sY35fvgvAuTx3m8Xd","bibbaseid":"bannister-devanny-eppstein-goodrich-thegaloiscomplexityofgraphdrawingwhynumericalsolutionsareubiquitousforforcedirectedspectralandcirclepackingdrawings-2015","downloads":0,"creationDate":"2015-12-10T07:18:33.528Z","title":"The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings.","author_short":["Bannister, M. J.","Devanny, W. E.","Eppstein, D.","Goodrich, M. T."],"year":2015,"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/\"David Barner\"?items=1000","bibdata":{"bibtype":"article","type":"article","added-at":"2015-12-03T00:00:00.000+0100","author":[{"propositions":[],"lastnames":["Bannister"],"firstnames":["Michael","J."],"suffixes":[]},{"propositions":[],"lastnames":["Devanny"],"firstnames":["William","E."],"suffixes":[]},{"propositions":[],"lastnames":["Eppstein"],"firstnames":["David"],"suffixes":[]},{"propositions":[],"lastnames":["Goodrich"],"firstnames":["Michael","T."],"suffixes":[]}],"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","bibtex":"@article{journals/jgaa/BannisterDEG15,\n added-at = {2015-12-03T00:00:00.000+0100},\n author = {Bannister, Michael J. and Devanny, William E. and Eppstein, David and Goodrich, Michael T.},\n biburl = {http://www.bibsonomy.org/bibtex/2a323dabde2ae26c6adc4bbd35d5500b7/dblp},\n ee = {http://dx.doi.org/10.7155/jgaa.00349},\n interhash = {0ccf8c55f1edfec415efb4b1e79cc271},\n intrahash = {a323dabde2ae26c6adc4bbd35d5500b7},\n journal = {J. Graph Algorithms Appl.},\n keywords = {dblp},\n number = 2,\n pages = {619-656},\n timestamp = {2015-12-04T11:34:44.000+0100},\n title = {The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings.},\n url = {http://dblp.uni-trier.de/db/journals/jgaa/jgaa19.html#BannisterDEG15},\n volume = 19,\n year = 2015\n}\n\n","author_short":["Bannister, M. J.","Devanny, W. E.","Eppstein, D.","Goodrich, M. T."],"key":"journals/jgaa/BannisterDEG15","id":"journals/jgaa/BannisterDEG15","bibbaseid":"bannister-devanny-eppstein-goodrich-thegaloiscomplexityofgraphdrawingwhynumericalsolutionsareubiquitousforforcedirectedspectralandcirclepackingdrawings-2015","role":"author","urls":{"Link":"http://dx.doi.org/10.7155/jgaa.00349","Paper":"http://dblp.uni-trier.de/db/journals/jgaa/jgaa19.html#BannisterDEG15"},"keyword":["dblp"],"downloads":0},"search_terms":["galois","complexity","graph","drawing","numerical","solutions","ubiquitous","force","directed","spectral","circle","packing","drawings","bannister","devanny","eppstein","goodrich"],"keywords":["dblp"],"authorIDs":[],"dataSources":["q834SFRu5LXFafhq7"]}