乐胖代购免代理版

{"id":"https://openalex.org/W2167058518","doi":"https://doi.org/10.1017/s0960129501003577","title":"Constraint satisfaction algorithms for graph pattern matching","display_name":"Constraint satisfaction algorithms for graph pattern matching","publication_year":2002,"publication_date":"2002-08-01","ids":{"openalex":"https://openalex.org/W2167058518","doi":"https://doi.org/10.1017/s0960129501003577","mag":"2167058518"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0960129501003577","pdf_url":null,"source":{"id":"https://openalex.org/S101766102","display_name":"Mathematical Structures in Computer Science","issn_l":"0960-1295","issn":["0960-1295","1469-8072"],"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":true,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-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/A5056490295","display_name":"Javier Larrosa","orcid":"https://orcid.org/0000-0002-8322-0505"},"institutions":[{"id":"https://openalex.org/I9617848","display_name":"Universitat Polit\u00e8cnica de Catalunya","ror":"https://ror.org/03mb6wj31","country_code":"ES","type":"education","lineage":["https://openalex.org/I9617848"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"JAVIER LARROSA","raw_affiliation_strings":["Department of Software, Technical University of Catalonia, Barcelona, Spain"],"affiliations":[{"raw_affiliation_string":"Department of Software, Technical University of Catalonia, Barcelona, Spain","institution_ids":["https://openalex.org/I9617848"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005629452","display_name":"Gabriel Valiente","orcid":"https://orcid.org/0000-0001-9194-2703"},"institutions":[{"id":"https://openalex.org/I9617848","display_name":"Universitat Polit\u00e8cnica de Catalunya","ror":"https://ror.org/03mb6wj31","country_code":"ES","type":"education","lineage":["https://openalex.org/I9617848"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"GABRIEL VALIENTE","raw_affiliation_strings":["Department of Software, Technical University of Catalonia, Barcelona, Spain"],"affiliations":[{"raw_affiliation_string":"Department of Software, Technical University of Catalonia, Barcelona, Spain","institution_ids":["https://openalex.org/I9617848"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.758,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":130,"citation_normalized_percentile":{"value":0.992796,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":98},"biblio":{"volume":"12","issue":"4","first_page":"403","last_page":"422"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9997,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9997,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9994,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.998,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/benchmark","display_name":"Benchmark (surveying)","score":0.7632069}],"concepts":[{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.7632069},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7194181},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.55175465},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.55091316},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.50595134},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4980154},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.48637798},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.4806922},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.45925683},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.45607027},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40963358},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19811675},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.116595715},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"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/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0960129501003577","pdf_url":null,"source":{"id":"https://openalex.org/S101766102","display_name":"Mathematical Structures in Computer Science","issn_l":"0960-1295","issn":["0960-1295","1469-8072"],"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":true,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":46,"referenced_works":["https://openalex.org/W1506257272","https://openalex.org/W1522863580","https://openalex.org/W1528090900","https://openalex.org/W1539249567","https://openalex.org/W1563468814","https://openalex.org/W1566095850","https://openalex.org/W1592840579","https://openalex.org/W1605917420","https://openalex.org/W1967140769","https://openalex.org/W1967974926","https://openalex.org/W1974032838","https://openalex.org/W1985850469","https://openalex.org/W1994652641","https://openalex.org/W2000874574","https://openalex.org/W2002478775","https://openalex.org/W2008734993","https://openalex.org/W2011039300","https://openalex.org/W2011398297","https://openalex.org/W2021930057","https://openalex.org/W2022739485","https://openalex.org/W2035609387","https://openalex.org/W2043193943","https://openalex.org/W2048799163","https://openalex.org/W2056229702","https://openalex.org/W2064540888","https://openalex.org/W2068379792","https://openalex.org/W2068852367","https://openalex.org/W2073787578","https://openalex.org/W2082403159","https://openalex.org/W2083216665","https://openalex.org/W2086198191","https://openalex.org/W2087237081","https://openalex.org/W2091984336","https://openalex.org/W2093152516","https://openalex.org/W2126359798","https://openalex.org/W2134152592","https://openalex.org/W2135432705","https://openalex.org/W2136761100","https://openalex.org/W2137174949","https://openalex.org/W2138037655","https://openalex.org/W2145580869","https://openalex.org/W2156026918","https://openalex.org/W2156153879","https://openalex.org/W2164279585","https://openalex.org/W2227618531","https://openalex.org/W2913256821"],"related_works":["https://openalex.org/W2784687883","https://openalex.org/W2569549435","https://openalex.org/W2252314269","https://openalex.org/W2161128834","https://openalex.org/W2102858635","https://openalex.org/W2097415053","https://openalex.org/W2091348864","https://openalex.org/W2012694101","https://openalex.org/W2012141606","https://openalex.org/W1550482496"],"abstract_inverted_index":{"Graph":[0],"pattern":[1],"matching":[2],"is":[3,13,30,66,96,115,129,170],"a":[4,24,37,57,67,91,119,132,152],"central":[5],"problem":[6,79,161],"in":[7,81,102,125],"many":[8,160],"application":[9],"fields.":[10],"Since":[11],"it":[12],"NP-":[14],"complete":[15],",":[16],"we":[17,44,61,145],"cannot":[18],"expect":[19],"to":[20,83,98],"find":[21],"algorithms":[22,124,174],"with":[23,36],"good":[25,38],"worst-case":[26],"performance.":[27,40],"However,":[28],"there":[29],"still":[31,158],"room":[32],"for":[33,122,172],"general":[34],"procedures":[35],"average":[39],"In":[41,142],"this":[42,113,126,143,167],"paper":[43,114],"explore":[45],"four":[46],"different":[47],"solving":[48],"approaches":[49,101],"within":[50],"the":[51,78,85,99,116],"constraint":[52],"satisfaction":[53],"framework,":[54],"and":[55],"introduce":[56],"new":[58,120],"algorithm,":[59],"which":[60],"call":[62],"nRF+.":[63],"The":[64,164],"algorithm":[65],"refinement":[68],"of":[69,77,104,106,112,118,135,138,155,166],"really":[70],"full":[71],"look":[72,86],"ahead":[73,87],"that":[74,94,147],"takes":[75],"advantage":[76],"structure":[80],"order":[82],"enhance":[84],"procedure.":[88],"We":[89],"give":[90],"formal":[92],"proof":[93],"nRF+":[95,148],"superior":[97],"other":[100],"terms":[103],"number":[105],"visited":[107],"nodes.":[108],"An":[109],"additional":[110],"contribution":[111],"introduction":[117],"benchmark":[121,169],"testing":[123],"domain.":[127],"It":[128],"formed":[130],"by":[131],"large":[133],"set":[134],"well-defined":[136],"graphs":[137],"very":[139],"diverse":[140],"nature.":[141],"benchmark,":[144],"show":[146],"can":[149],"efficiently":[150],"solve":[151],"broad":[153],"range":[154],"problems,":[156],"while":[157],"leaving":[159],"instances":[162],"unsolved.":[163],"use":[165],"challenging":[168],"encouraged":[171],"future":[173],"evaluation.":[175]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2167058518","counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":6}],"updated_date":"2025-01-23T01:03:38.017273","created_date":"2016-06-24"}