{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T00:27:28Z","timestamp":1729643248016,"version":"3.28.0"},"reference-count":33,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,4]]},"DOI":"10.1109\/pacificvis.2009.4906842","type":"proceedings-article","created":{"date-parts":[[2009,5,4]],"date-time":"2009-05-04T19:47:40Z","timestamp":1241466460000},"page":"89-96","source":"Crossref","is-referenced-by-count":0,"title":["A visual canonical adjacency matrix for graphs"],"prefix":"10.1109","author":[{"family":"Hongli Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georges","family":"Grinstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Loura","family":"Costello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"19"},{"key":"17","first-page":"34","article-title":"moderately exponential bound for graph isomorphism","volume":"117","author":"babai","year":"1981","journal-title":"LNCS"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46648-7_29"},{"journal-title":"Computer Solution of Large Sparse Positive Definite Prentice Hall Professional Technical Reference","year":"1981","author":"george","key":"33"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1145\/214392.214398"},{"key":"16","first-page":"181","article-title":"graph isomorphism","author":"skiena","year":"1990","journal-title":"Implementing Discrete Mathematics Combinatorics and Graph Theory with Mathematica"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.3.3.255"},{"key":"14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/1031001","article-title":"evolution of the minimum degree ordering algorithm","volume":"31","author":"george","year":"1989","journal-title":"SIAM Review"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1137\/0713023"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(00)00325-8"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"},{"journal-title":"Geometric Symmetry in Graphs","year":"1990","author":"manning","key":"20"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1145\/1133905.1133915"},{"key":"23","article-title":"substructure discovery in the subdue system","author":"holder","year":"1994","journal-title":"Proc Workshop Knowledge Discovery in Databases"},{"key":"24","first-page":"13","article-title":"an apriori-based algorithm for mining frequent substructures from graph data","author":"inokuchi","year":"2000","journal-title":"The 4th European Conf on Principles and Practice of Knowledge Discovery in Databases (PKDD) Lyon France"},{"key":"25","first-page":"721","article-title":"gspan: graph-based substructure pattern mining","author":"fan","year":"2002","journal-title":"IEEE Intl Conf on Data Mining ICDM Maebashi City Japan"},{"key":"26","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1145\/956750.956784","article-title":"closegraph: mining closed frequent graph patterns","author":"yan","year":"2003","journal-title":"Proc 9th ACM SIGKDD Int l Conf Knowledge Discovery and Data Mining"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2001.989534"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2003.1250974"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1137\/0715069"},{"journal-title":"The graph isomorphism problem","year":"1996","author":"fortin","key":"3"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1137\/0209025"},{"journal-title":"Handbook of Graph Theory","year":"2004","key":"10"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2007.70582"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1145\/355841.355845"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2006.160"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/INFVIS.2004.1"},{"key":"32","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1145\/355705.355712","article-title":"algorithm 508: matrix bandwidth and profile reduction [f1]","volume":"2","author":"h l crane","year":"1976","journal-title":"ACM Transactions on Mathematical Software (TOMS)"},{"journal-title":"Semiology of Graphics Diagrams Networks Maps","year":"1984","author":"bertin","key":"5"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1145\/1499799.1499935"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/APVIS.2007.329289"},{"key":"9","first-page":"369","author":"hubbard","year":"0","journal-title":"Schaum's Outline of Data Structures with Java"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/800195.805928"}],"event":{"name":"2009 IEEE Pacific Visualization Symposium (PacificVis)","start":{"date-parts":[[2009,4,20]]},"location":"Beijing, China","end":{"date-parts":[[2009,4,23]]}},"container-title":["2009 IEEE Pacific Visualization Symposium"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4816119\/4906819\/04906842.pdf?arnumber=4906842","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,4]],"date-time":"2021-10-04T22:22:04Z","timestamp":1633386124000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4906842\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,4]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/pacificvis.2009.4906842","relation":{},"subject":[],"published":{"date-parts":[[2009,4]]}}}