{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T19:15:52Z","timestamp":1673637352664},"reference-count":10,"publisher":"Institution of Engineering and Technology (IET)","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEE Proc., Softw."],"published-print":{"date-parts":[[2004]]},"DOI":"10.1049\/ip-sen:20041180","type":"journal-article","created":{"date-parts":[[2005,1,4]],"date-time":"2005-01-04T14:59:24Z","timestamp":1104850764000},"page":"257","source":"Crossref","is-referenced-by-count":2,"title":["Taxonomy of directed graph representations"],"prefix":"10.1049","volume":"151","author":[{"given":"G.","family":"Barla-Szabo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.W.","family":"Watson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.G.","family":"Kourie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"265","reference":[{"key":"10.1049\/ip-sen:20041180_r1","unstructured":"Algorithmic Solutions Software, \u2018Leda \u2013 library of efficient data types and algorithms\u2019, http:\/\/www.algorithmic-solutions.com\/enleda.htm, accessed 22 July 2004"},{"key":"10.1049\/ip-sen:20041180_r2","unstructured":"Mehlhorn, K., and Nher, St: \u2018The LEDA platform of combinatorial and geometric computing\u2019, (Cambridge University Press 1999),1st edn."},{"key":"10.1049\/ip-sen:20041180_r3","unstructured":"Stepanov, A.: \u2018Boost graph library\u2019, http:\/\/www.boost.org\/libs\/graph\/doc\/table_of_contents.html, accessed 22 July 2004"},{"key":"10.1049\/ip-sen:20041180_r4","unstructured":"Lee, L.Q., Siek, J.G., and Lumsdaine, A.: \u2018The Boost graph library: user guide and reference manual\u2019, (Addison-Wesley 2001),1st edn."},{"key":"10.1049\/ip-sen:20041180_r5","unstructured":"Waggoner, B.: \u2018Biography of Linnaeus\u2019, http:\/\/www.ucmp.berkeley.edu\/history\/linnaeus.html, accessed 22 July 2004"},{"key":"10.1049\/ip-sen:20041180_r6","unstructured":"Howard, J.D.: \u2018A taxonomy of computer and network attacks\u2019, http:\/\/www.cert.org\/research\/JHThesis\/Chapter6.html, accessed 22 July 2004"},{"key":"10.1049\/ip-sen:20041180_r7","unstructured":"Altas, I.: \u2018Taxonomy of computer architectures (Flynn 1996)\u2019, http:\/\/athene.csu.edu.au\/~ialtas\/module1\/section_3.html, accessed 22 July 2004"},{"key":"10.1049\/ip-sen:20041180_r8","unstructured":"Watson, B.W.: \u2018Taxonomies and toolkits of regular language algorithms\u2019, , PhD Thesis, Technische Universiteit Eindhoven"},{"key":"10.1049\/ip-sen:20041180_r9","doi-asserted-by":"crossref","unstructured":"Gries, D., and Schneider, F.B.: \u2018A logical approach to discrete math\u2019, (Springer-Verlag 1993),1st edn.","DOI":"10.1007\/978-1-4757-3837-7"},{"key":"10.1049\/ip-sen:20041180_r10","unstructured":"Barla-Szabo, G.: \u2018A taxonomy of graph representations\u2019, 2002, MSc Dissertation, University of Pretoria"}],"container-title":["IEE Proceedings - Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/digital-library.theiet.org\/content\/journals\/10.1049\/ip-sen_20041180?crawler=true&mimetype=application\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T03:17:56Z","timestamp":1609471076000},"score":1,"resource":{"primary":{"URL":"https:\/\/digital-library.theiet.org\/content\/journals\/10.1049\/ip-sen_20041180"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"references-count":10,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2004]]}},"URL":"https:\/\/doi.org\/10.1049\/ip-sen:20041180","relation":{},"ISSN":["1462-5970"],"issn-type":[{"value":"1462-5970","type":"print"}],"subject":[],"published":{"date-parts":[[2004]]}}}