{"id":"https://openalex.org/W1910274815","doi":"https://doi.org/10.15439/2015f329","title":"Maximum Exploratory Equivalence in Trees","display_name":"Maximum Exploratory Equivalence in Trees","publication_year":2015,"publication_date":"2015-10-11","ids":{"openalex":"https://openalex.org/W1910274815","doi":"https://doi.org/10.15439/2015f329","mag":"1910274815"},"language":"en","primary_location":{"id":"doi:10.15439/2015f329","is_oa":true,"landing_page_url":"https://doi.org/10.15439/2015f329","pdf_url":"https://annals-csis.org/proceedings/2015/pliks/329.pdf","source":{"id":"https://openalex.org/S4220651875","display_name":"Annals of Computer Science and Information Systems","issn_l":"2300-5963","issn":["2300-5963"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":"https://openalex.org/P4310317484","host_organization_name":"Polskie Towarzystwo Informatyczne","host_organization_lineage":["https://openalex.org/P4310317484"],"host_organization_lineage_names":["Polskie Towarzystwo Informatyczne"],"type":"conference"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Computer Science and Information Systems","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://annals-csis.org/proceedings/2015/pliks/329.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049347517","display_name":"Luka F\u00fcrst","orcid":"https://orcid.org/0000-0002-9223-7253"},"institutions":[{"id":"https://openalex.org/I153976015","display_name":"University of Ljubljana","ror":"https://ror.org/05njb9z20","country_code":"SI","type":"education","lineage":["https://openalex.org/I153976015"]}],"countries":["SI"],"is_corresponding":false,"raw_author_name":"Luka F\u00fcrst","raw_affiliation_strings":["University of Ljubljana, Faculty of computer and information science, Ve\u010dna pot 113, SI-1000, Slovenia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Ljubljana, Faculty of computer and information science, Ve\u010dna pot 113, SI-1000, Slovenia","institution_ids":["https://openalex.org/I153976015"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050977526","display_name":"Uro\u0161 \u010cibej","orcid":null},"institutions":[{"id":"https://openalex.org/I153976015","display_name":"University of Ljubljana","ror":"https://ror.org/05njb9z20","country_code":"SI","type":"education","lineage":["https://openalex.org/I153976015"]}],"countries":["SI"],"is_corresponding":false,"raw_author_name":"Uro\u0161 \u010cibej","raw_affiliation_strings":["University of Ljubljana, Faculty of computer and information science, Ve\u010dna pot 113, SI-1000, Slovenia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Ljubljana, Faculty of computer and information science, Ve\u010dna pot 113, SI-1000, Slovenia","institution_ids":["https://openalex.org/I153976015"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053501152","display_name":"Jurij Miheli\u010d","orcid":"https://orcid.org/0000-0002-7662-4827"},"institutions":[{"id":"https://openalex.org/I153976015","display_name":"University of Ljubljana","ror":"https://ror.org/05njb9z20","country_code":"SI","type":"education","lineage":["https://openalex.org/I153976015"]}],"countries":["SI"],"is_corresponding":false,"raw_author_name":"Jurij Miheli\u010d","raw_affiliation_strings":["University of Ljubljana, Faculty of computer and information science, Ve\u010dna pot 113, SI-1000, Slovenia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Ljubljana, Faculty of computer and information science, Ve\u010dna pot 113, SI-1000, Slovenia","institution_ids":["https://openalex.org/I153976015"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I153976015"],"apc_list":null,"apc_paid":null,"fwci":0.1352,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.40312871,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"5","issue":null,"first_page":"507","last_page":"518"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9995999932289124,"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.9995999932289124,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.7218018174171448},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.6873107552528381},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.6251245737075806},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.506928026676178},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.501577615737915},{"id":"https://openalex.org/keywords/automorphism","display_name":"Automorphism","score":0.4968912899494171},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.446870893239975},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4274742007255554},{"id":"https://openalex.org/keywords/graph-homomorphism","display_name":"Graph homomorphism","score":0.4269122779369354},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4209389388561249},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3859325349330902},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.369894802570343},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.35884618759155273},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.18782415986061096},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.124360591173172}],"concepts":[{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.7218018174171448},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.6873107552528381},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.6251245737075806},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.506928026676178},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.501577615737915},{"id":"https://openalex.org/C118712358","wikidata":"https://www.wikidata.org/wiki/Q782566","display_name":"Automorphism","level":2,"score":0.4968912899494171},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.446870893239975},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4274742007255554},{"id":"https://openalex.org/C7036158","wikidata":"https://www.wikidata.org/wiki/Q3385162","display_name":"Graph homomorphism","level":5,"score":0.4269122779369354},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4209389388561249},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3859325349330902},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.369894802570343},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.35884618759155273},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.18782415986061096},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.124360591173172}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.15439/2015f329","is_oa":true,"landing_page_url":"https://doi.org/10.15439/2015f329","pdf_url":"https://annals-csis.org/proceedings/2015/pliks/329.pdf","source":{"id":"https://openalex.org/S4220651875","display_name":"Annals of Computer Science and Information Systems","issn_l":"2300-5963","issn":["2300-5963"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":"https://openalex.org/P4310317484","host_organization_name":"Polskie Towarzystwo Informatyczne","host_organization_lineage":["https://openalex.org/P4310317484"],"host_organization_lineage_names":["Polskie Towarzystwo Informatyczne"],"type":"conference"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Computer Science and Information Systems","raw_type":"proceedings-article"},{"id":"pmh:oai:doaj.org/article:1adb28dd32184ac0b1d0987e76bd9063","is_oa":false,"landing_page_url":"https://doaj.org/article/1adb28dd32184ac0b1d0987e76bd9063","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Annals of computer science and information systems, Vol 5, Pp 507-518 (2015)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.15439/2015f329","is_oa":true,"landing_page_url":"https://doi.org/10.15439/2015f329","pdf_url":"https://annals-csis.org/proceedings/2015/pliks/329.pdf","source":{"id":"https://openalex.org/S4220651875","display_name":"Annals of Computer Science and Information Systems","issn_l":"2300-5963","issn":["2300-5963"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":"https://openalex.org/P4310317484","host_organization_name":"Polskie Towarzystwo Informatyczne","host_organization_lineage":["https://openalex.org/P4310317484"],"host_organization_lineage_names":["Polskie Towarzystwo Informatyczne"],"type":"conference"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Computer Science and Information Systems","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1910274815.pdf","grobid_xml":"https://content.openalex.org/works/W1910274815.grobid-xml"},"referenced_works_count":32,"referenced_works":["https://openalex.org/W165726963","https://openalex.org/W933993264","https://openalex.org/W1498992687","https://openalex.org/W1527197079","https://openalex.org/W1533368239","https://openalex.org/W1655990431","https://openalex.org/W1687588989","https://openalex.org/W1910274815","https://openalex.org/W1990600049","https://openalex.org/W1992028263","https://openalex.org/W1992120303","https://openalex.org/W1997617095","https://openalex.org/W2004964534","https://openalex.org/W2008734993","https://openalex.org/W2010880586","https://openalex.org/W2015963099","https://openalex.org/W2027876313","https://openalex.org/W2036265926","https://openalex.org/W2050197389","https://openalex.org/W2052936500","https://openalex.org/W2069351567","https://openalex.org/W2078462949","https://openalex.org/W2090523415","https://openalex.org/W2126359798","https://openalex.org/W2140344792","https://openalex.org/W2147405597","https://openalex.org/W2157312249","https://openalex.org/W2912269841","https://openalex.org/W2914155449","https://openalex.org/W4230158058","https://openalex.org/W4298404569","https://openalex.org/W4381304672"],"related_works":["https://openalex.org/W2542507283","https://openalex.org/W1482551403","https://openalex.org/W2393701947","https://openalex.org/W4254708154","https://openalex.org/W3008959778","https://openalex.org/W1965191464","https://openalex.org/W2954463587","https://openalex.org/W167435155","https://openalex.org/W2018568077","https://openalex.org/W231720905"],"abstract_inverted_index":{"Many":[0],"practical":[1],"problems":[2],"are":[3],"modeled":[4],"with":[5],"networks":[6],"and":[7,15,53],"graphs.":[8,146,177],"Their":[9],"exploration":[10],"is":[11,46,66,120,142,170],"of":[12,29,84,95,102,164],"significant":[13],"importance,":[14],"several":[16],"graph-exploration":[17],"algorithms":[18],"already":[19],"exist.":[20],"In":[21,72,104],"this":[22,169],"paper,":[23,106],"we":[24,107,130,148],"focus":[25],"on":[26,50],"a":[27,37,67,75,93,132,153,160],"type":[28],"vertex":[30],"equivalence,":[31,34],"called":[32],"exploratory":[33,87,111,155],"which":[35,65],"has":[36,79],"great":[38],"potential":[39],"to":[40,92,97,144,159],"speed":[41],"up":[42],"such":[43],"algorithms.":[44],"It":[45],"an":[47],"equivalence":[48,112],"based":[49],"graph":[51,78,126],"automorphisms":[52],"can,":[54],"for":[55,135,151,175],"example,":[56],"help":[57],"us":[58],"in":[59],"solving":[60,136],"the":[61,99,105,109,117,125,137,140,173],"subgraph":[62,165],"isomorphism":[63,127,166],"problem,":[64],"well-known":[68],"NP":[69],"-hard":[70],"problem.":[71,113,128],"particular,":[73],"if":[74],"given":[76],"pattern":[77],"nontrivial":[80,86],"automorphisms,":[81],"then":[82],"each":[83],"its":[85],"equivalent":[88,156],"classes":[89],"gives":[90],"rise":[91],"set":[94,163],"constraints":[96],"prune":[98],"search":[100],"space":[101],"solutions.":[103],"define":[108],"maximum":[110,154],"We":[114],"show":[115,149],"that":[116,150],"defined":[118],"problem":[119,138],"at":[121],"least":[122],"as":[123],"hard":[124],"Additionally,":[129],"present":[131],"polynomial-time":[133],"algorithm":[134],"when":[139],"input":[141],"restricted":[143],"tree":[145],"Furthermore,":[147],"trees,":[152],"partition":[157],"leads":[158],"globally":[161],"optimal":[162],"constraints,":[167],"whereas":[168],"not":[171],"necessarily":[172],"case":[174],"general":[176]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}