{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T22:28:46Z","timestamp":1781216926253,"version":"3.54.1"},"reference-count":15,"publisher":"SAGE Publications","issue":"2","license":[{"start":{"date-parts":[[2005,6,1]],"date-time":"2005-06-01T00:00:00Z","timestamp":1117584000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Visualization"],"published-print":{"date-parts":[[2005,6]]},"abstract":"<jats:p>In this article, we describe a taxonomy of generic graph related tasks along with a computer-based evaluation designed to assess the readability of two representations of graphs: matrix-based representations and node-link diagrams. This evaluation encompasses seven generic tasks and leads to insightful recommendations for the representation of graphs according to their size and density. Typically, we show that when graphs are bigger than twenty vertices, the matrix-based visualization outperforms node-link diagrams on most tasks. Only path finding is consistently in favor of node-link diagrams throughout the evaluation.<\/jats:p>","DOI":"10.1057\/palgrave.ivs.9500092","type":"journal-article","created":{"date-parts":[[2005,5,12]],"date-time":"2005-05-12T05:27:43Z","timestamp":1115875663000},"page":"114-135","source":"Crossref","is-referenced-by-count":243,"title":["On the Readability of Graphs Using Node-Link and Matrix-Based Representations: A Controlled Experiment and Statistical Analysis"],"prefix":"10.1177","volume":"4","author":[{"given":"Mohammad","family":"Ghoniem","sequence":"first","affiliation":[{"name":"Ecole des Mines de Nantes, Nantes, Cedex 3, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean-Daniel","family":"Fekete","sequence":"additional","affiliation":[{"name":"INRIA Futurs\/LRI, B\u00e2t 490, Universit\u00e9 Paris-Sud, Orsay, Cedex, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Philippe","family":"Castagliola","sequence":"additional","affiliation":[{"name":"IRCCyN\/IUT de Nantes, Rue Christian Pauc \u2013 La Chantrerie, Nantes, Cedex 3, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"179","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"bibr1-palgrave.ivs.9500092","volume-title":"Graph Drawing.","author":"Battista GD","year":"1999"},{"key":"bibr2-palgrave.ivs.9500092","doi-asserted-by":"publisher","DOI":"10.1145\/264216.264222"},{"key":"bibr3-palgrave.ivs.9500092","doi-asserted-by":"publisher","DOI":"10.1109\/OZCHI.1998.732199"},{"key":"bibr4-palgrave.ivs.9500092","doi-asserted-by":"publisher","DOI":"10.1023\/A:1016344215610"},{"key":"bibr5-palgrave.ivs.9500092","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.ivs.9500013"},{"key":"bibr6-palgrave.ivs.9500092","volume-title":"Volume upper bounds for 3D graph drawing","author":"Cohen RF","year":"1994"},{"key":"bibr7-palgrave.ivs.9500092","doi-asserted-by":"publisher","DOI":"10.1109\/2945.841119"},{"key":"bibr8-palgrave.ivs.9500092","doi-asserted-by":"publisher","DOI":"10.1109\/INFVIS.2004.1"},{"key":"bibr9-palgrave.ivs.9500092","unstructured":"Bertin J. S\u00e9miologie graphique: Les diagrammes \u2013 Les r\u00e9seaux \u2013 Les cartes. Editions de l'Ecole des Hautes Etudes en Sciences 1967 (Paris, France)."},{"key":"bibr10-palgrave.ivs.9500092","doi-asserted-by":"publisher","DOI":"10.1109\/2945.468391"},{"key":"bibr11-palgrave.ivs.9500092","unstructured":"Ham FV. Using multilevel call matrices in large software projects. in:\n                      Proceedings of the IEEE Symp. Information Visualization\n                      2003 (Seattle, WA, USA), IEEE Press: New York, 227\u2013232."},{"key":"bibr12-palgrave.ivs.9500092","volume-title":"VISEXP: visualizing constraint solver dynamics using explanations","author":"Ghoniem M","year":"2004"},{"key":"bibr13-palgrave.ivs.9500092","unstructured":"AT&T Labs Research Graphviz \u2013 open source graph drawing software, 2004 http:\/\/www.research.att.com\/sw\/tools\/graphviz\/."},{"key":"bibr14-palgrave.ivs.9500092","unstructured":"ISPT, Waseda University Random Graph Server. http:\/\/www.ispt.waseda.ac.jp\/rgs\/index.html."},{"key":"bibr15-palgrave.ivs.9500092","volume-title":"Applied Statistics and Probability for Engineers.","author":"Montgomery DC","year":"1999"}],"container-title":["Information Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1057\/palgrave.ivs.9500092","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1057\/palgrave.ivs.9500092","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T19:19:34Z","timestamp":1777490374000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1057\/palgrave.ivs.9500092"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2005,6]]}},"alternative-id":["10.1057\/palgrave.ivs.9500092"],"URL":"https:\/\/doi.org\/10.1057\/palgrave.ivs.9500092","relation":{},"ISSN":["1473-8716","1473-8724"],"issn-type":[{"value":"1473-8716","type":"print"},{"value":"1473-8724","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,6]]}}}