{"id":"https://openalex.org/W2112523291","doi":"https://doi.org/10.1109/icde.2011.5767909","title":"CT-index: Fingerprint-based graph indexing combining cycles and trees","display_name":"CT-index: Fingerprint-based graph indexing combining cycles and trees","publication_year":2011,"publication_date":"2011-04-01","ids":{"openalex":"https://openalex.org/W2112523291","doi":"https://doi.org/10.1109/icde.2011.5767909","mag":"2112523291"},"language":"en","primary_location":{"id":"doi:10.1109/icde.2011.5767909","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icde.2011.5767909","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE 27th International Conference on Data Engineering","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5023110492","display_name":"Karsten Klein","orcid":"https://orcid.org/0000-0002-8345-5806"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Karsten Klein","raw_affiliation_strings":["Department of Computer Science, Technische Universit\u00e4t Dortmund, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Technische Universit\u00e4t Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009569829","display_name":"Nils M. Kriege","orcid":"https://orcid.org/0000-0003-2645-947X"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Nils Kriege","raw_affiliation_strings":["Department of Computer Science, Technische Universit\u00e4t Dortmund, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Technische Universit\u00e4t Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012801992","display_name":"Petra Mutzel","orcid":"https://orcid.org/0000-0001-7621-971X"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Petra Mutzel","raw_affiliation_strings":["Department of Computer Science, Technische Universit\u00e4t Dortmund, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Technische Universit\u00e4t Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5023110492"],"corresponding_institution_ids":["https://openalex.org/I200332995"],"apc_list":null,"apc_paid":null,"fwci":2.318,"has_fulltext":false,"cited_by_count":47,"citation_normalized_percentile":{"value":0.90629674,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1115","last_page":"1126"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.9933000206947327,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.8190240859985352},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7035822868347168},{"id":"https://openalex.org/keywords/search-engine-indexing","display_name":"Search engine indexing","score":0.5345697999000549},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4993751049041748},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.490759938955307},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.48191407322883606},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.4785937964916229},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.4542740285396576},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.41059449315071106},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19416671991348267},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.10760623216629028}],"concepts":[{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.8190240859985352},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7035822868347168},{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.5345697999000549},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4993751049041748},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.490759938955307},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.48191407322883606},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.4785937964916229},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.4542740285396576},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.41059449315071106},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19416671991348267},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.10760623216629028},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icde.2011.5767909","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icde.2011.5767909","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE 27th International Conference on Data Engineering","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W938539187","https://openalex.org/W1480017700","https://openalex.org/W1498814251","https://openalex.org/W1517186914","https://openalex.org/W1655990431","https://openalex.org/W1933330694","https://openalex.org/W1990061958","https://openalex.org/W2008734993","https://openalex.org/W2011039300","https://openalex.org/W2013497015","https://openalex.org/W2017645867","https://openalex.org/W2027943354","https://openalex.org/W2028326521","https://openalex.org/W2079668713","https://openalex.org/W2083342911","https://openalex.org/W2099962227","https://openalex.org/W2100080493","https://openalex.org/W2111036405","https://openalex.org/W2126359798","https://openalex.org/W2142965177","https://openalex.org/W2145631416","https://openalex.org/W2147405597","https://openalex.org/W2155070669","https://openalex.org/W2163652601","https://openalex.org/W2168209541","https://openalex.org/W2169310183","https://openalex.org/W6640263165","https://openalex.org/W6674917368","https://openalex.org/W6680870402"],"related_works":["https://openalex.org/W1482551403","https://openalex.org/W84561889","https://openalex.org/W2954463587","https://openalex.org/W2393701947","https://openalex.org/W1965191464","https://openalex.org/W2915540008","https://openalex.org/W1887488684","https://openalex.org/W2018568077","https://openalex.org/W167435155","https://openalex.org/W2128390795"],"abstract_inverted_index":{"Efficient":[0],"subgraph":[1,34,40,100],"queries":[2],"in":[3,10],"large":[4],"databases":[5],"are":[6,25],"a":[7,73,82,88,98,139,165],"time-critical":[8],"task":[9],"many":[11],"application":[12],"areas":[13],"as":[14,27,158],"e.g.":[15],"biology":[16],"or":[17,22],"chemistry,":[18],"where":[19],"biological":[20],"networks":[21],"chemical":[23,172],"compounds":[24],"modeled":[26],"graphs.":[28],"The":[29],"NP-completeness":[30],"of":[31,57,90,132,142,160,171],"the":[32,68,78,125,161,168],"underlying":[33],"isomorphism":[35,101],"problem":[36],"renders":[37],"an":[38,129],"exact":[39],"test":[41,102],"for":[42,95,103,124,167],"each":[43],"database":[44],"graph":[45,148],"infeasible.":[46],"Therefore":[47],"efficient":[48],"methods":[49,137],"have":[50],"to":[51,63,109,119],"be":[52],"found":[53],"that":[54,150],"avoid":[55],"most":[56],"these":[58],"tests":[59],"but":[60],"still":[61],"allow":[62],"identify":[64],"all":[65],"graphs":[66],"containing":[67],"query":[69],"pattern.":[70],"We":[71,127],"propose":[72],"new":[74,83,99],"approach":[75,106,134,155],"based":[76],"on":[77],"filter-verification":[79],"paradigm,":[80],"using":[81,138],"hash-key":[84],"fingerprint":[85],"technique":[86],"with":[87,111,135],"combination":[89],"tree":[91],"and":[92,97,113,116,146],"cycle":[93],"features":[94],"filtering":[96],"verification.":[104],"Our":[105,154],"is":[107,156],"able":[108],"cope":[110],"edge":[112],"vertex":[114],"labels":[115],"also":[117],"allows":[118],"use":[120],"wild":[121],"card":[122],"patterns":[123],"search.":[126],"present":[128],"experimental":[130],"comparison":[131],"our":[133],"state-of-the-art":[136],"benchmark":[140],"set":[141],"both":[143],"real":[144],"world":[145],"generated":[147],"instances":[149],"shows":[151],"its":[152],"practicability.":[153],"implemented":[157],"part":[159],"Scaffold":[162],"Hunter":[163],"software,":[164],"tool":[166],"visual":[169],"analysis":[170],"compound":[173],"databases.":[174]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":6},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}