dc.contributor.author | Wang, Junhu | |
dc.contributor.author | Ren, Xuguang | |
dc.contributor.author | Anirban, Shikha | |
dc.contributor.author | Wu, Xin-Wen | |
dc.date.accessioned | 2019-06-27T12:30:52Z | |
dc.date.available | 2019-06-27T12:30:52Z | |
dc.date.issued | 2019 | |
dc.identifier.issn | 0020-0255 | |
dc.identifier.doi | 10.1016/j.ins.2019.01.036 | |
dc.identifier.uri | http://hdl.handle.net/10072/384448 | |
dc.description.abstract | We present a revised filtering process that corrects an error in our previous work on subgraph isomorphism search over compressed graphs. We provide additional experiments to test the contribution of the compression itself and the candidate filtering to the performance of four representative backtracking-based subgraph isomorphism search algorithms. | |
dc.description.peerreviewed | Yes | |
dc.language | English | |
dc.language.iso | eng | |
dc.publisher | Elsevier Science | |
dc.relation.ispartofpagefrom | 363 | |
dc.relation.ispartofpageto | 373 | |
dc.relation.ispartofjournal | INFORMATION SCIENCES | |
dc.relation.ispartofvolume | 482 | |
dc.subject.fieldofresearch | Mathematical sciences | |
dc.subject.fieldofresearch | Engineering | |
dc.subject.fieldofresearchcode | 49 | |
dc.subject.fieldofresearchcode | 40 | |
dc.title | Correct filtering for subgraph isomorphism search in compressed vertex-labeled graphs | |
dc.type | Journal article | |
dc.type.description | C1 - Articles | |
dc.type.code | C - Journal Articles | |
gro.hasfulltext | No Full Text | |
gro.griffith.author | Wang, John | |