{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T19:57:50Z","timestamp":1725998270699},"publisher-location":"Singapore","reference-count":18,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811318092"},{"type":"electronic","value":"9789811318108"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-981-13-1810-8_13","type":"book-chapter","created":{"date-parts":[[2018,10,30]],"date-time":"2018-10-30T16:04:59Z","timestamp":1540915499000},"page":"124-133","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Bounded Paths for LCR Queries in Labeled Weighted Directed Graphs"],"prefix":"10.1007","author":[{"given":"B.","family":"Bhargavi","sequence":"first","affiliation":[]},{"given":"K. Swarupa","family":"Rani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,31]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Valstar, L.D.J., Fletcher, G.H.L., Yoshida, Y.: Landmark indexing for evaluation of label-constrained reachability queries. In: Proceedings of 2017 ACM International Conference on Management of Data, SIGMOD, Chicago (2017)","DOI":"10.1145\/3035918.3035955"},{"key":"13_CR2","unstructured":"Singh, K., Singh, V.: Graph pattern matching: a brief survey of challenges and research directions. In: 3rd International Conference on Computing for Sustainable Global Development, pp. 199\u2013204. IEEE(2016)"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-319-21668-3_2","volume-title":"Computer Aided Verification","author":"A Erez","year":"2015","unstructured":"Erez, A., Nadel, A.: Finding bounded path in graph using SMT for automatic clock routing. In: Kroening, D., P\u0103s\u0103reanu, C.S. (eds.) CAV 2015. LNCS, vol. 9207, pp. 20\u201336. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21668-3_2"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.is.2013.10.003","volume":"40","author":"Lei Zou","year":"2014","unstructured":"Zou, L., Xu, K., Chen, L., Xiao, Y., Zhao, D., Yu, J.X.: Efficient processing of label-constraint reachability queries in large graphs. J. Inf. Syst. 40, 47\u201366 (2014)","journal-title":"Information Systems"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-319-05810-8_13","volume-title":"Database Systems for Advanced Applications","author":"M Chen","year":"2014","unstructured":"Chen, M., Gu, Y., Bao, Y., Yu, G.: Label and distance-constraint reachability queries in uncertain graphs. In: Bhowmick, S.S., Dyreson, C.E., Jensen, C.S., Lee, M.L., Muliantara, A., Thalheim, B. (eds.) DASFAA 2014. LNCS, vol. 8421, pp. 188\u2013202. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-05810-8_13"},{"key":"13_CR6","unstructured":"Bonchi, F., Gionis, A., Gullo, F., Ukkonen, A.: Distance Oracles in edge-labeled graphs. In: Proceedings of the 17th International Conference on Extending Database Technology, pp. 547\u2013558. EDBT (2014)"},{"issue":"3","key":"13_CR7","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s00778-012-0288-4","volume":"22","author":"Miao Qiao","year":"2012","unstructured":"Qiao, M., Cheng, H., Qin, L., Yu, J.X., Yu, P.S., Chang, L.: Computing weight constraint reachability in large networks. VLDB J. 22(3), 275\u2013294 (2013)","journal-title":"The VLDB Journal"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Likhyani, A., Bedathur, S.: Label constrained shortest path estimation. In: 22nd International Conference on Information and Knowledge Management, pp. 1177\u20131180. ACM (2013)","DOI":"10.1145\/2505515.2507818"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Fan, W., Li, J., Ma, S., Tang, N., Wu, Y.: Adding regular expressions to graph reachability and pattern queries. In: 27th IEEE Proceedings of ICDE, pp. 39\u201350 (2011)","DOI":"10.1109\/ICDE.2011.5767858"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Malewicz, G., et al.: Pregel: a system for large-scale graph processing. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data, pp. 135\u2013146 (2010)","DOI":"10.1145\/1807167.1807184"},{"key":"13_CR11","series-title":"Advances in Database Systems Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-6045-0","volume-title":"Managing and Mining Graph Data","author":"CC Aggarwal","year":"2010","unstructured":"Aggarwal, C.C., Wang, H.: Managing and Mining Graph Data. Advances in Database Systems Series. Springer, New York (2010). https:\/\/doi.org\/10.1007\/978-1-4419-6045-0"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Jin, R., Hong, H., Wang, H., Ruan, N., Xiang, Y.: Computing label-constraint reachability in graph databases. In: Proceedings of the ACM International Conference on Management of Data, USA, pp. 123\u2013134 (2010)","DOI":"10.1145\/1807167.1807183"},{"issue":"3","key":"13_CR13","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1137\/S0097539798337716","volume":"30","author":"Chris Barrett","year":"2000","unstructured":"Barrett, C., Jacob, R., Marathe, M.: Formal-language constrained path problems, SIAM J. Comput. 30(3), 809\u2013837 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"13_CR14","unstructured":"Neo4j. https:\/\/neo4j.com\/"},{"key":"13_CR15","unstructured":"InfiniteGraph. http:\/\/www.objectivity.com\/infinitegraph"},{"key":"13_CR16","unstructured":"Twitter FlockDB. https:\/\/github.com\/twitter\/flockdb"},{"key":"13_CR17","unstructured":"SNAP: A general purpose network analysis and graph mining library in C++. http:\/\/snap.stanford.edu\/snap"},{"key":"13_CR18","unstructured":"Konect - the Koblenz Network Collection. http:\/\/konect.uni-koblenz.de\/"}],"container-title":["Communications in Computer and Information Science","Advances in Computing and Data Sciences"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-13-1810-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,29]],"date-time":"2019-10-29T21:26:41Z","timestamp":1572384401000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-13-1810-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9789811318092","9789811318108"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-981-13-1810-8_13","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"ICACDS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Advances in Computing and Data Sciences","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dehradun","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 April 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 April 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icacds2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.icacds.com","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}