更改

跳到导航 跳到搜索
删除143字节 、 2020年11月22日 (日) 01:27
第168行: 第168行:  
*{{citation|first1=Giuseppe|last1=Di Battista|first2=Massimo|last2=Rimondini|contribution=Computer Networks|pages=763–803|editor-first=Roberto|editor-last=Tamassia|editor-link=Roberto Tamassia|title=Handbook of Graph Drawing and Visualization|publisher=CRC Press|year=2014}}.
 
*{{citation|first1=Giuseppe|last1=Di Battista|first2=Massimo|last2=Rimondini|contribution=Computer Networks|pages=763–803|editor-first=Roberto|editor-last=Tamassia|editor-link=Roberto Tamassia|title=Handbook of Graph Drawing and Visualization|publisher=CRC Press|year=2014}}.
 
*{{citation | last1 = Doğrusöz | first1 = Uğur | last2 = Madden | first2 = Brendan| last3 = Madden | first3 = Patrick | editor-last = North | editor-first = Stephen| contribution = Circular layout in the Graph Layout toolkit | doi = 10.1007/3-540-62495-3_40 | pages = 92–100| publisher = Springer-Verlag | series = Lecture Notes in Computer Science | title = Symposium on Graph Drawing, GD '96 Berkeley, California, USA, September 18–20, 1996, Proceedings | volume = 1190 | year = 1997| isbn = 978-3-540-62495-0 | doi-access = free }}.
 
*{{citation | last1 = Doğrusöz | first1 = Uğur | last2 = Madden | first2 = Brendan| last3 = Madden | first3 = Patrick | editor-last = North | editor-first = Stephen| contribution = Circular layout in the Graph Layout toolkit | doi = 10.1007/3-540-62495-3_40 | pages = 92–100| publisher = Springer-Verlag | series = Lecture Notes in Computer Science | title = Symposium on Graph Drawing, GD '96 Berkeley, California, USA, September 18–20, 1996, Proceedings | volume = 1190 | year = 1997| isbn = 978-3-540-62495-0 | doi-access = free }}.
*{{citation| last1 = Eiglsperger | first1 = Markus | last2 = Fekete | first2 = Sándor | last3 = Klau | first3 = Gunnar | contribution = Orthogonal graph drawing | doi = 10.1007/3-540-44969-8_6
+
*{{citation| last1 = Eiglsperger | first1 = Markus | last2 = Fekete | first2 = Sándor | last3 = Klau | first3 = Gunnar | contribution = Orthogonal graph drawing | doi = 10.1007/3-540-44969-8_6 | editor1-last = Kaufmann | editor1-first = Michael | editor2-last = Wagner | editor2-first = Dorothea |pages = 121–171 | publisher = Springer Berlin / Heidelberg | series = Lecture Notes in Computer Science | title = Drawing Graphs | volume = 2025 | year = 2001| isbn = 978-3-540-42062-0 }}.
| editor1-last = Kaufmann | editor1-first = Michael | editor2-last = Wagner | editor2-first = Dorothea |pages = 121–171 | publisher = Springer Berlin / Heidelberg
+
*{{citation | last = Freese | first = Ralph | editor-last = Eklund | editor-first = Peter | contribution = Automated lattice drawing | doi = 10.1007/978-3-540-24651-0_12 | pages = 589–590 | publisher = Springer-Verlag | series = Lecture Notes in Computer Science | title = Concept Lattices: Second International Conference on Formal Concept Analysis, ICFCA 2004, Sydney, Australia, February 23-26, 2004, Proceedings | url = http://www.math.hawaii.edu/~ralph/Preprints/latdrawing.pdf | volume = 2961 | year = 2004| isbn = 978-3-540-21043-6 | citeseerx = 10.1.1.69.6245 }}.
| series = Lecture Notes in Computer Science | title = Drawing Graphs | volume = 2025 | year = 2001| isbn = 978-3-540-42062-0 }}.
  −
*{{citation | last = Freese | first = Ralph | editor-last = Eklund | editor-first = Peter | contribution = Automated lattice drawing | doi = 10.1007/978-3-540-24651-0_12 | pages = 589–590
  −
| publisher = Springer-Verlag | series = Lecture Notes in Computer Science | title = Concept Lattices: Second International Conference on Formal Concept Analysis, ICFCA 2004, Sydney, Australia, February 23-26, 2004, Proceedings | url = http://www.math.hawaii.edu/~ralph/Preprints/latdrawing.pdf | volume = 2961 | year = 2004| isbn = 978-3-540-21043-6 | citeseerx = 10.1.1.69.6245 }}.
   
*{{citation | last1 = Garg | first1 = Ashim | last2 = Tamassia | first2 = Roberto | doi = 10.1007/BF01108622| issue = 2 | journal = Order | mr = 1354797 | pages = 109–133 | title = Upward planarity testing | volume = 12 | year = 1995| citeseerx = 10.1.1.10.2237 }}.
 
*{{citation | last1 = Garg | first1 = Ashim | last2 = Tamassia | first2 = Roberto | doi = 10.1007/BF01108622| issue = 2 | journal = Order | mr = 1354797 | pages = 109–133 | title = Upward planarity testing | volume = 12 | year = 1995| citeseerx = 10.1.1.10.2237 }}.
*{{citation | last1 = Holten | first1 = Danny | last2 = Isenberg | first2 = Petra | last3 = van Wijk | first3 = Jarke J. | author3-link = Jack van Wijk | last4 = Fekete | first4 = Jean-Daniel
+
*{{citation | last1 = Holten | first1 = Danny | last2 = Isenberg | first2 = Petra | last3 = van Wijk | first3 = Jarke J. | author3-link = Jack van Wijk | last4 = Fekete | first4 = Jean-Daniel | last4 = Fekete | first4 = Jean-Daniel | contribution = An extended evaluation of the readability of tapered, animated, and textured directed-edge representations in node-link graphs | doi = 10.1109/PACIFICVIS.2011.5742390 | pages = 195–202 | title = IEEE Pacific Visualization Symposium (PacificVis 2011) | url = http://www.lri.fr/~isenberg/publications/papers/Holten_2011_AEP.pdf | year = 2011| isbn = 978-1-61284-935-5 }}.
| last4 = Fekete | first4 = Jean-Daniel | contribution = An extended evaluation of the readability of tapered, animated, and textured directed-edge representations in node-link graphs
+
*{{citation |last1= Holten |first1 = Danny |last2 = van Wijk |first2= Jarke J. |contribution = A user study on visualizing directed edges in graphs |doi= 10.1145/1518701.1519054 |pages= 2299–2308 |title= Proceedings of the 27th International Conference on Human Factors in Computing Systems (CHI '09) |url= http://www.win.tue.nl/~dholten/papers/directed_edges_chi.pdf |year = 2009 |url-status= dead |archiveurl  = https://web.archive.org/web/20111106004500/http://www.win.tue.nl/~dholten/papers/directed_edges_chi.pdf|archivedate  = 2011-11-06|isbn= 9781605582467 |citeseerx= 10.1.1.212.5461}}.
| doi = 10.1109/PACIFICVIS.2011.5742390 | pages = 195–202 | title = IEEE Pacific Visualization Symposium (PacificVis 2011) | url = http://www.lri.fr/~isenberg/publications/papers/Holten_2011_AEP.pdf | year = 2011| isbn = 978-1-61284-935-5 }}.
+
*{{citation | last = Koren | first = Yehuda | doi = 10.1016/j.camwa.2004.08.015 | issue = 11–12 | journal = Computers & Mathematics with Applications | mr = 2154691 | pages = 1867–1888 | title = Drawing graphs by eigenvectors: theory and practice | url = https://akpublic.research.att.com/areas/visualization/papers_videos/pdf/DBLP-journals-camwa-Koren05.pdf| volume = 49| year = 2005| access-date = 2011-09-17 | archive-url = https://web.archive.org/web/20120402131402/https://akpublic.research.att.com/areas/visualization/papers_videos/pdf/DBLP-journals-camwa-Koren05.pdf| archive-date = 2012-04-02 | url-status = dead }}.
*{{citation |last1= Holten |first1 = Danny |last2 = van Wijk |first2= Jarke J. |contribution = A user study on visualizing directed edges in graphs |doi= 10.1145/1518701.1519054
  −
|pages= 2299–2308 |title= Proceedings of the 27th International Conference on Human Factors in Computing Systems (CHI '09) |url= http://www.win.tue.nl/~dholten/papers/directed_edges_chi.pdf
  −
|year = 2009 |url-status= dead |archiveurl  = https://web.archive.org/web/20111106004500/http://www.win.tue.nl/~dholten/papers/directed_edges_chi.pdf|archivedate  = 2011-11-06|isbn= 9781605582467
  −
|citeseerx= 10.1.1.212.5461}}.
  −
*{{citation | last = Koren | first = Yehuda | doi = 10.1016/j.camwa.2004.08.015 | issue = 11–12 | journal = Computers & Mathematics with Applications | mr = 2154691 | pages = 1867–1888 | title = Drawing graphs by eigenvectors: theory and practice | url = https://akpublic.research.att.com/areas/visualization/papers_videos/pdf/DBLP-journals-camwa-Koren05.pdf| volume = 49| year = 2005| access-date = 2011-09-17 | archive-url = https://web.archive.org/web/20120402131402/https://akpublic.research.att.com/areas/visualization/papers_videos/pdf/DBLP-journals-camwa-Koren05.pdf| archive-date = 2012-04-02 | url-status = dead
  −
}}.
   
*{{citation | last = Longabaugh | first = William | doi = 10.1186/1471-2105-13-275 | journal = BMC Bioinformatics | pages = 275 | title = Combing the hairball with BioFabric: a new approach for visualization of large networks | url = http://www.biomedcentral.com/content/pdf/1471-2105-13-275.pdf| pmid = 23102059| volume = 13| year = 2012| pmc=3574047}}.
 
*{{citation | last = Longabaugh | first = William | doi = 10.1186/1471-2105-13-275 | journal = BMC Bioinformatics | pages = 275 | title = Combing the hairball with BioFabric: a new approach for visualization of large networks | url = http://www.biomedcentral.com/content/pdf/1471-2105-13-275.pdf| pmid = 23102059| volume = 13| year = 2012| pmc=3574047}}.
 
*{{citation| last1 = Madden | first1 = Brendan| last2 = Madden | first2 = Patrick| last3 = Powers | first3 = Steve| last4 = Himsolt | first4 = Michael| editor-last = Brandenburg | editor-first = Franz J.| contribution = Portable graph layout and editing| doi = 10.1007/BFb0021822| pages = 385–395 | publisher = Springer-Verlag| series = Lecture Notes in Computer Science| title = Graph Drawing: Symposium on Graph Drawing, GD '95, Passau, Germany, September 20–22, 1995, Proceedings | volume = 1027| year = 1996| title-link = International Symposium on Graph Drawing| isbn = 978-3-540-60723-6| doi-access = free }}.
 
*{{citation| last1 = Madden | first1 = Brendan| last2 = Madden | first2 = Patrick| last3 = Powers | first3 = Steve| last4 = Himsolt | first4 = Michael| editor-last = Brandenburg | editor-first = Franz J.| contribution = Portable graph layout and editing| doi = 10.1007/BFb0021822| pages = 385–395 | publisher = Springer-Verlag| series = Lecture Notes in Computer Science| title = Graph Drawing: Symposium on Graph Drawing, GD '95, Passau, Germany, September 20–22, 1995, Proceedings | volume = 1027| year = 1996| title-link = International Symposium on Graph Drawing| isbn = 978-3-540-60723-6| doi-access = free }}.
第188行: 第179行:  
*{{citation| last1 = Nachmanson | first1 = Lev | last2 = Robertson | first2 = George| last3 = Lee | first3 = Bongshin| editor1-last = Hong | editor1-first = Seok-Hee | editor2-last = Nishizeki | editor2-first = Takao| editor3-last = Quan | editor3-first = Wu| contribution = Drawing Graphs with GLEE| doi = 10.1007/978-3-540-77537-9_38| pages = 389–394| publisher = Springer-Verlag| series = Lecture Notes in Computer Science| title = Graph Drawing, 15th International Symposium, GD 2007, Sydney, Australia, September 24–26, 2007, Revised Papers| contribution-url = ftp://ftp.research.microsoft.com/pub/TR/TR-2007-72.pdf| volume = 4875| year = 2008|| isbn = 978-3-540-77536-2| doi-access = free }}.
 
*{{citation| last1 = Nachmanson | first1 = Lev | last2 = Robertson | first2 = George| last3 = Lee | first3 = Bongshin| editor1-last = Hong | editor1-first = Seok-Hee | editor2-last = Nishizeki | editor2-first = Takao| editor3-last = Quan | editor3-first = Wu| contribution = Drawing Graphs with GLEE| doi = 10.1007/978-3-540-77537-9_38| pages = 389–394| publisher = Springer-Verlag| series = Lecture Notes in Computer Science| title = Graph Drawing, 15th International Symposium, GD 2007, Sydney, Australia, September 24–26, 2007, Revised Papers| contribution-url = ftp://ftp.research.microsoft.com/pub/TR/TR-2007-72.pdf| volume = 4875| year = 2008|| isbn = 978-3-540-77536-2| doi-access = free }}.
 
*{{citation| last1 = Pach | first1 = János | last2 = Sharir | first2 = Micha | contribution = 5.5 Angular resolution and slopes| pages = 126–127| publisher = American Mathematical Society | publisher = American Mathematical Society | series = Mathematical Surveys and Monographs | title = Combinatorial Geometry and Its Algorithmic Applications: The Alcalá Lectures| volume = 152| year = 2009}}.
 
*{{citation| last1 = Pach | first1 = János | last2 = Sharir | first2 = Micha | contribution = 5.5 Angular resolution and slopes| pages = 126–127| publisher = American Mathematical Society | publisher = American Mathematical Society | series = Mathematical Surveys and Monographs | title = Combinatorial Geometry and Its Algorithmic Applications: The Alcalá Lectures| volume = 152| year = 2009}}.
*{{citation | last1 = Purchase | first1 = H. C. | last2 = Cohen | first2 = R. F. | last3 = James | first3 = M. I. | at = Article 4| doi = 10.1145/264216.264222| journal = Journal of Experimental Algorithmics | title = An experimental study of the basis for graph drawing algorithms| url = https://secure.cs.uvic.ca/twiki/pub/Research/Chisel/ComputationalAestheticsProject/Vol2Nbr4.pdf | volume = 2| year = 1997 }}{{Dead link|date=January 2020 |bot=InternetArchiveBot |fix-attempted=yes }}.
+
*{{citation | last1 = Purchase | first1 = H. C. | last2 = Cohen | first2 = R. F. | last3 = James | first3 = M. I. | at = Article 4| doi = 10.1145/264216.264222| journal = Journal of Experimental Algorithmics | title = An experimental study of the basis for graph drawing algorithms| url = https://secure.cs.uvic.ca/twiki/pub/Research/Chisel/ComputationalAestheticsProject/Vol2Nbr4.pdf | volume = 2| year = 1997 }}.
 
*{{citation | last = Saaty | first = Thomas L. | journal = Proc. Natl. Acad. Sci. U.S.A. | pages = 688–690 | title = The minimum number of intersections in complete graphs | volume = 52 | volume = 52| issue = 3 | year = 1964 | doi=10.1073/pnas.52.3.688| pmid = 16591215 | pmc = 300329}}.
 
*{{citation | last = Saaty | first = Thomas L. | journal = Proc. Natl. Acad. Sci. U.S.A. | pages = 688–690 | title = The minimum number of intersections in complete graphs | volume = 52 | volume = 52| issue = 3 | year = 1964 | doi=10.1073/pnas.52.3.688| pmid = 16591215 | pmc = 300329}}.
 
*{{citation|title=Social network analysis: a handbook|first=John|last=Scott|edition=2nd|publisher=Sage|year=2000|isbn=978-0-7619-6339-4|contribution=Sociograms and Graph Theory|url=https://books.google.com/books?id=Ww3_bKcz6kgC&pg=PA|pages=64–69}}.
 
*{{citation|title=Social network analysis: a handbook|first=John|last=Scott|edition=2nd|publisher=Sage|year=2000|isbn=978-0-7619-6339-4|contribution=Sociograms and Graph Theory|url=https://books.google.com/books?id=Ww3_bKcz6kgC&pg=PA|pages=64–69}}.
*{{citation|first1=Kozo|last1=Sugiyama|author1-link=Kozo Sugiyama|first2=Shôjirô|last2=Tagawa|first3=Mitsuhiko|last3=Toda|title=Methods for visual understanding of hierarchical system structures|journal=[[IEEE Systems, Man & Cybernetics Society|IEEE Transactions on Systems, Man, and Cybernetics]]|volume=SMC-11|issue=2|pages=109–125|year=1981|mr=0611436|doi=10.1109/TSMC.1981.4308636}}.
+
*{{citation|first1=Kozo|last1=Sugiyama|author1-link=Kozo Sugiyama|first2=Shôjirô|last2=Tagawa|first3=Mitsuhiko|last3=Toda|title=Methods for visual understanding of hierarchical system structures|journal=IEEE Systems, Man & Cybernetics Society|volume=SMC-11|issue=2|pages=109–125|year=1981|mr=0611436|doi=10.1109/TSMC.1981.4308636}}.
 
*{{citation | last = Tantau | first = Till | doi = 10.7155/jgaa.00301 | issue = 4 | journal = Journal of Graph Algorithms and Applications | pages = 495–513 | title = Graph Drawing in TikZ | volume = 17 | year = 2013}}.
 
*{{citation | last = Tantau | first = Till | doi = 10.7155/jgaa.00301 | issue = 4 | journal = Journal of Graph Algorithms and Applications | pages = 495–513 | title = Graph Drawing in TikZ | volume = 17 | year = 2013}}.
* {{Citation | last1=Zapponi | first1=Leonardo | title=What is a Dessin d'Enfant | url=http://www.ams.org/notices/200307/what-is.pdf | date=August 2003 | journal=[[Notices of the American Mathematical Society]] | volume=50 | pages=788–789}}.
+
* {{Citation | last1=Zapponi | first1=Leonardo | title=What is a Dessin d'Enfant | url=http://www.ams.org/notices/200307/what-is.pdf | date=August 2003 | journal=Notices of the American Mathematical Society | volume=50 | pages=788–789}}.
    
{{refend}}
 
{{refend}}
7,129

个编辑

导航菜单