iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://api.crossref.org/works/10.1109/ACCESS.2019.2908930
{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T22:59:51Z","timestamp":1648681191625},"reference-count":20,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100005022","name":"Beijing Jiaotong University","doi-asserted-by":"publisher","award":["356072535"],"id":[{"id":"10.13039\/501100005022","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2908930","type":"journal-article","created":{"date-parts":[[2019,4,2]],"date-time":"2019-04-02T18:59:37Z","timestamp":1554231577000},"page":"44555-44561","source":"Crossref","is-referenced-by-count":1,"title":["Impact Vertices-Aware Diffusion Walk Algorithm for Efficient Subgraph Pattern Matching in Massive Graphs"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"http:\/\/orcid.org\/0000-0001-5864-2186","authenticated-orcid":false,"given":"Lihua","family":"Ai","sequence":"first","affiliation":[]},{"given":"Lakshmish","family":"Ramaswamy","sequence":"additional","affiliation":[]},{"given":"Siwei","family":"Luo","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816703"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.75"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2696940"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.29268\/stbd.2014.1.1.1"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492576"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.14778\/2095686.2095690"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2013.6691601"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF02066689","article-title":"On the strength of connectedness of a random graph","volume":"12","author":"erd\u00f5s","year":"1961","journal-title":"Acta Math Hungarica"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2484838.2484843"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/321556.321562"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/321765.321766"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(80)90057-4"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-6487-7_5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920986"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78568-2_34"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/BigDataCongress.2015.132"},{"key":"ref9","first-page":"1033","article-title":"Top-K graph pattern matching over large graphs","author":"cheng","year":"2013","journal-title":"Proc IEEE 29th Int Conf ICDE"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963488"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08679957.pdf?arnumber=8679957","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T18:03:04Z","timestamp":1643306584000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8679957\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2908930","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}