{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:54:22Z","timestamp":1742968462647,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642201486"},{"type":"electronic","value":"9783642201493"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20149-3_39","type":"book-chapter","created":{"date-parts":[[2011,4,8]],"date-time":"2011-04-08T22:41:56Z","timestamp":1302302516000},"page":"543-557","source":"Crossref","is-referenced-by-count":1,"title":["Optimizing Incremental Maintenance of Minimal Bisimulation of Cyclic Graphs"],"prefix":"10.1007","author":[{"given":"Jintian","family":"Deng","sequence":"first","affiliation":[]},{"given":"Byron","family":"Choi","sequence":"additional","affiliation":[]},{"given":"Jianliang","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Sourav S.","family":"Bhowmick","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"39_CR1","unstructured":"Batagelj, V., Mrvar, A.: Pajek datasets, http:\/\/vlado.fmf.uni-lj.si\/pub\/networks\/data\/"},{"key":"39_CR2","series-title":"Lecture Notes in Computer Science","volume-title":"Database Theory - ICDT \u201997","author":"P. Buneman","year":"1996","unstructured":"Buneman, P., Davidson, S.B., Fernandez, M.F., Suciu, D.: Adding structure to unstructured data. In: Afrati, F.N., Kolaitis, P.G. (eds.) ICDT 1997. LNCS, vol.\u00a01186, Springer, Heidelberg (1996)"},{"key":"39_CR3","doi-asserted-by":"crossref","unstructured":"Buneman, P., Grohe, M., Koch, C.: Path queries on compressed XML. In: VLDB (2003)","DOI":"10.1016\/B978-012722442-8\/50021-5"},{"key":"39_CR4","doi-asserted-by":"crossref","unstructured":"Chen, Q., Lim, A., Ong, K.W.: D(k)-index: an adaptive structural summary for graph-structured data. In: SIGMOD (2003)","DOI":"10.1145\/872773.872776"},{"key":"39_CR5","doi-asserted-by":"crossref","unstructured":"Deng, J., Choi, B., Xu, J., Bhowmick, S.S.: Optimizing incremental maintenance of minimal bisimulation of cyclic graphs. Technical report, HKBU (2010), http:\/\/www.comp.hkbu.edu\/~jtdeng\/techreport.pdf","DOI":"10.1007\/978-3-642-20149-3_39"},{"issue":"1-3","key":"39_CR6","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0304-3975(03)00361-X","volume":"311","author":"A. Dovier","year":"2004","unstructured":"Dovier, A., Piazza, C., Policriti, A.: An efficient algorithm for computing bisimulation equivalence. Theor. Comput. Sci.\u00a0311(1-3), 221\u2013256 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"39_CR7","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1023\/A:1016091902809","volume":"21","author":"K. Fisler","year":"2002","unstructured":"Fisler, K., Vardi, M.Y.: Bisimulation minimization and symbolic model checking. Form. Methods Syst. Des.\u00a021(1), 39\u201378 (2002)","journal-title":"Form. Methods Syst. Des."},{"key":"39_CR8","unstructured":"Gleiss, P.M., Leydold, J., Stadler, P.F.: Circuit bases of strongly connected digraphs. Working Papers 01-10-056, Santa Fe Institute (2001), http:\/\/ideas.repec.org\/p\/wop\/safiwp\/01-10-056.html"},{"key":"39_CR9","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Languages and Programming","author":"M.R. Henzinger","year":"1997","unstructured":"Henzinger, M.R., King, V.: Maintaining minimum spanning trees in dynamic graphs. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol.\u00a01256. Springer, Heidelberg (1997)"},{"key":"39_CR10","doi-asserted-by":"crossref","unstructured":"Kaushik, R., Bohannon, P., Naughton, J.F., Shenoy, P.: Updates for structure indexes. In: VLDB (2002)","DOI":"10.1016\/B978-155860869-6\/50029-9"},{"key":"39_CR11","unstructured":"Kaushik, R., Shenoy, P., Bohannon, P., Gudes, E.: Exploiting local similarity for indexing paths in graph-structured data. In: ICDE (2002)"},{"key":"39_CR12","unstructured":"Ke, Y., Hao, H., Ioana, S., Jun, Y.: Incremental maintenance of XML structural indexes. In: SIGMOD (2004)"},{"key":"39_CR13","unstructured":"Leskovec, J.: Stanford large network dataset collection, http:\/\/snap.stanford.edu\/data"},{"key":"39_CR14","unstructured":"Li, H., Lee, M.L., Hsu, W., Cong, G.: An estimation system for XPath expressions. In: ICDE (2006)"},{"key":"39_CR15","unstructured":"Mendelzon, A.O., Wood, P.T.: Finding regular simple paths in graph databases. In: VLDB (1989)"},{"key":"39_CR16","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall, Englewood Cliffs (1989)"},{"key":"39_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/3-540-49257-7_18","volume-title":"Database Theory - ICDT\u201999","author":"T. Milo","year":"1999","unstructured":"Milo, T., Suciu, D.: Index structures for path expressions. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol.\u00a01540, pp. 277\u2013295. Springer, Heidelberg (1999)"},{"issue":"6","key":"39_CR18","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R. Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM J. Comput.\u00a016(6), 973\u2013989 (1987)","journal-title":"SIAM J. Comput."},{"key":"39_CR19","doi-asserted-by":"crossref","unstructured":"Polyzotis, N., Garofalakis, M.: XCluster synopses for structured XML content. In: ICDE (2006)","DOI":"10.1109\/ICDE.2006.175"},{"key":"39_CR20","doi-asserted-by":"crossref","unstructured":"Polyzotis, N., Garofalakis, M.: XSketch synopses for XML data graphs. ACM Trans. Database Syst.\u00a031(3) (2006)","DOI":"10.1145\/1166074.1166082"},{"key":"39_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/978-3-540-77050-3_17","volume-title":"FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science","author":"D. Saha","year":"2007","unstructured":"Saha, D.: An incremental bisimulation algorithm. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol.\u00a04855, pp. 204\u2013215. Springer, Heidelberg (2007)"},{"key":"39_CR22","doi-asserted-by":"crossref","unstructured":"Schmidt, A., Waas, F., Kersten, M., Carey, M.J., Manolescu, I., Busse, R.: XMark: A benchmark for XML data management. In: VLDB (2002)","DOI":"10.1016\/B978-155860869-6\/50096-2"},{"key":"39_CR23","doi-asserted-by":"crossref","unstructured":"Spiegel, J., Polyzotis, N.: Graph-based synopses for relational selectivity estimation. In: SIGMOD (2006)","DOI":"10.1145\/1142473.1142497"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20149-3_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,21]],"date-time":"2021-11-21T10:58:05Z","timestamp":1637492285000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20149-3_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642201486","9783642201493"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20149-3_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}