{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:19:43Z","timestamp":1725664783087},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540624950"},{"type":"electronic","value":"9783540680482"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-62495-3_51","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:37:54Z","timestamp":1330295874000},"page":"233-240","source":"Crossref","is-referenced-by-count":12,"title":["The graphlet system (system demonstration)"],"prefix":"10.1007","author":[{"given":"Michael","family":"Himsolt","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","volume":"4","author":"G. Battista Di","year":"1994","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Algorithms for drawing graphs: an annotated bibliography. Comput. Geom. Theory Appl. 4 (1994) 235\u2013282","journal-title":"Comput. Geom. Theory Appl."},{"key":"19_CR2","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BFb0021795","volume":"1027","author":"L. Buti","year":"1995","unstructured":"Buti, L., Di Battista, G., Liotta, G., Tassinari, E., Vargiu, F., Vismara, L.: GD-Workbench: A System for Prototyping and Testing Graph Drawing Algorithms. In Lecture Notes in Computer Science 1027, pp. 111\u2013122 (1995)","journal-title":"Lecture Notes in Computer Science"},{"key":"19_CR3","first-page":"409","volume":"1027","author":"Y. Carbonneaux","year":"1995","unstructured":"Carbonneaux, Y., Laborde, J.-M., Madani, M.: CABRI-Graph: A Tool for Research and Teaching in Graph Theory. In Lecture Notes in Computer Science 1027, pp. 409\u2013418 (1995)","journal-title":"Lecture Notes in Computer Science"},{"key":"19_CR4","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1007\/3-540-58950-3_379","volume":"894","author":"M. Fr\u00f6hlich","year":"1994","unstructured":"Fr\u00f6hlich, M., Werner, M.: Demonstration of the Interactive Graph-Visualization System da Vinci. In Lecture Notes in Computer Science 894, pp. 266\u2013269. (1994)","journal-title":"Lecture Notes in Computer Science"},{"key":"19_CR5","unstructured":"Information on Graphlet is available on the world wide web at http:\/\/www.fmi.uni-passau.de\/Graphlet."},{"key":"19_CR6","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1007\/3-540-58950-3_370","volume":"894","author":"M. Himsolt","year":"1994","unstructured":"M. Himsolt: GraphEd: A Graphical Platform for the Implementation of Graph Algorithms. In Lecture Notes in Computer Science 894, pp. 182\u2013193. (1994)","journal-title":"Lecture Notes in Computer Science"},{"key":"19_CR7","unstructured":"Knuth, D.E.: The Stanford GraphBase: A Platform for Combinatorial Algorithms. Stanford University (1993)"},{"issue":"1","key":"19_CR8","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1145\/204865.204889","volume":"38","author":"K. Mehlhorn","year":"1995","unstructured":"Mehlhorn, K., N\u00e4her, S.: LEDA: A library of efficient data types and algorithms, Comm. ACM 38(1), pp. 96\u2013102 (1995).","journal-title":"Comm. ACM"},{"key":"19_CR9","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BFb0021822","volume":"1027","author":"B. Madden","year":"1995","unstructured":"Madden, B., Madden, P., Powers, S., Himsolt, M.: Portable Graph Layout and Editing, In Lecture Notes in Computer Science 1027, pp. 385\u2013395 (1995)","journal-title":"Lecture Notes in Computer Science"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Newberry Paulisch, F.: The Design of an Extendible Graph Editor, Lecture Notes in Computer Science 704 (1993)","DOI":"10.1007\/BFb0019371"},{"key":"19_CR11","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/BFb0021824","volume":"1027","author":"S. North","year":"1995","unstructured":"North, S.: Incremental Layout in DynaDAG, In Lecture Notes in Computer Science 1027, pp. 409\u2013418 (1995)","journal-title":"Lecture Notes in Computer Science"},{"key":"19_CR12","unstructured":"Ousterhout, J.: Tcl and the Tk Toolkit. Addison-Wesley (1994)."},{"key":"19_CR13","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1007\/3-540-58950-3_371","volume":"894","author":"G. Sander","year":"1994","unstructured":"Sander, G.: Graph Layout through the VCG Tool, In Lecture Notes in Computer Science 894, pp. 194\u2013205. (1994)","journal-title":"Lecture Notes in Computer Science"},{"key":"19_CR14","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1007\/BFb0021834","volume":"1027","author":"K. Sugiyama","year":"1995","unstructured":"Sugiyama, K., Misue, K.: A Generic Compound Graph Visualizer\/Manipulator: D-ABDUCTOR, In Lecture Notes in Computer Science 1027, pp. 500\u2013503 (1995)","journal-title":"Lecture Notes in Computer Science"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62495-3_51.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:38:19Z","timestamp":1619573899000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62495-3_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540624950","9783540680482"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-62495-3_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}