Silom usmereno crtanje grafova (Serbian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Silom usmereno crtanje grafova" in Serbian language version.

refsWebsite

Global rank Serbian rank

2^nd place

4^th place

69^th place

240^th place

1,592^nd place

1,094^th place

207^th place

370^th place

1^st place

8,263^rd place

4,713^th place

120^th place

187^th place

arizona.edu

Chernobelskiy, R.; Cunningham, K.; Goodrich, M. T.; Kobourov, S. G.; Trott, L. (2011), „Force-directed Lombardi-style graph drawing”, Proc. 19th Symposium on Graph Drawing (PDF), стр. 78—90

Kobourov, Stephen G. (2012), Spring Embedders and Force-Directed Graph Drawing Algorithms, arXiv:1201.3011 
Bannister, M. J.; Eppstein, D.; Goodrich, M. T.; Trott, L. (2012), „Force-directed graph drawing using social gravity and scaling”, Proc. 20th Int. Symp. Graph Drawing, arXiv:1209.0748

de Leeuw, Jan (1988), „Convergence of the majorization method for multidimensional scaling”, Journal of Classification, Springer, 5 (2): 163—180, doi:10.1007/BF01897162
Collberg, Christian; Kobourov, Stephen; Nagra, Jasvir; Pitts, Jacob; Wampler, Kevin (2003), „A System for Graph-based Visualization of the Evolution of Software”, Proceedings of the 2003 ACM Symposium on Software Visualization (SoftVis '03) (PDF), New York, NY, USA: ACM, стр. 77—86; figures on pp. 212, ISBN 978-1-58113-642-5, doi:10.1145/774833.774844, „To achieve an aesthetically pleasing layout of the graph it is also necessary to employ modified Fruchterman–Reingold forces, as the Kamada–Kawai method does not achieve satisfactory methods by itself but rather creates a good approximate layout so that the Fruchterman-Reingold calculations can quickly "tidy up" the layout.”
Kamada, Tomihisa; Kawai, Satoru (1989), „An algorithm for drawing general undirected graphs”, Information Processing Letters, Elsevier, 31 (1): 7—15, doi:10.1016/0020-0190(89)90102-6
Tutte, W. T. (1963), „How to draw a graph”, Proceedings of the London Mathematical Society, 13 (52): 743—768, doi:10.1112/plms/s3-13.1.743
Fruchterman, Thomas M. J.; Reingold, Edward M. (1991), „Graph Drawing by Force-Directed Placement”, Software — Practice & Experience, Wiley, 21 (11): 1129—1164, doi:10.1002/spe.4380211102

Collberg, Christian; Kobourov, Stephen; Nagra, Jasvir; Pitts, Jacob; Wampler, Kevin (2003), „A System for Graph-based Visualization of the Evolution of Software”, Proceedings of the 2003 ACM Symposium on Software Visualization (SoftVis '03) (PDF), New York, NY, USA: ACM, стр. 77—86; figures on pp. 212, ISBN 978-1-58113-642-5, doi:10.1145/774833.774844, „To achieve an aesthetically pleasing layout of the graph it is also necessary to employ modified Fruchterman–Reingold forces, as the Kamada–Kawai method does not achieve satisfactory methods by itself but rather creates a good approximate layout so that the Fruchterman-Reingold calculations can quickly "tidy up" the layout.”

Quigley, Aaron; Eades, Peter (2001), „FADE: Graph Drawing, Clustering, and Visual Abstraction”, Proceedings of the 8th International Symposium on Graph Drawing (PDF), стр. 197—210, ISBN 978-3-540-41554-1, Архивирано из оригинала (PDF) 21. 05. 2006. г., Приступљено 30. 05. 2016

Quigley, Aaron; Eades, Peter (2001), „FADE: Graph Drawing, Clustering, and Visual Abstraction”, Proceedings of the 8th International Symposium on Graph Drawing (PDF), стр. 197—210, ISBN 978-3-540-41554-1, Архивирано из оригинала (PDF) 21. 05. 2006. г., Приступљено 30. 05. 2016