乐胖代购免代理版

{"id":"https://openalex.org/W3174133701","doi":"https://doi.org/10.1137/20m1313301","title":"The Recognition Problem of Graph Search Trees","display_name":"The Recognition Problem of Graph Search Trees","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3174133701","doi":"https://doi.org/10.1137/20m1313301","mag":"3174133701"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m1313301","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":true,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"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/A5028672431","display_name":"Jesse Beisegel","orcid":"https://orcid.org/0000-0002-8760-0169"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jesse Beisegel","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015390696","display_name":"Carolin Denkert","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Carolin Denkert","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111471446","display_name":"Ekkehard K\u00f6hler","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ekkehard K\u00f6hler","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027555306","display_name":"Matja\u017e Krnc","orcid":"https://orcid.org/0000-0002-4960-8901"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Matja\u017e Krnc","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058610742","display_name":"Nevena Piva\u010d","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nevena Piva\u010d","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014701179","display_name":"Robert Scheffler","orcid":"https://orcid.org/0000-0001-6007-4202"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Robert Scheffler","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5002855059","display_name":"Martin Strehler","orcid":"https://orcid.org/0000-0003-4241-6584"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Martin Strehler","raw_affiliation_strings":[],"affiliations":[]}],"institution_assertions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.647,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.674453,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":78,"max":80},"biblio":{"volume":"35","issue":"2","first_page":"1418","last_page":"1446"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9991,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9991,"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/T12288","display_name":"Optimization and Search Problems","score":0.9943,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9861,"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/lexicographical-order","display_name":"Lexicographical order","score":0.7658168},{"id":"https://openalex.org/keywords/depth-first-search","display_name":"Depth-first search","score":0.55087423},{"id":"https://openalex.org/keywords/breadth-first-search","display_name":"Breadth-first search","score":0.484155},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.48181406},{"id":"https://openalex.org/keywords/tr\u00e9maux-tree","display_name":"Tr\u00e9maux tree","score":0.46943238}],"concepts":[{"id":"https://openalex.org/C159254197","wikidata":"https://www.wikidata.org/wiki/Q1144915","display_name":"Lexicographical order","level":2,"score":0.7658168},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7455426},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7145518},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.6016907},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5843773},{"id":"https://openalex.org/C62692426","wikidata":"https://www.wikidata.org/wiki/Q816319","display_name":"Depth-first search","level":3,"score":0.55087423},{"id":"https://openalex.org/C138843760","wikidata":"https://www.wikidata.org/wiki/Q325904","display_name":"Breadth-first search","level":2,"score":0.484155},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.48181406},{"id":"https://openalex.org/C124302570","wikidata":"https://www.wikidata.org/wiki/Q7849146","display_name":"Tr\u00e9maux tree","level":5,"score":0.46943238},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4517351},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.41861823},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39139664},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24513176},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.1968627},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.13868001}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m1313301","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":true,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[{"funder":"https://openalex.org/F4320320875","funder_display_name":"Deutscher Akademischer Austauschdienst","award_id":null},{"funder":"https://openalex.org/F4320322554","funder_display_name":"Javna Agencija za Raziskovalno Dejavnost RS","award_id":"N1-0102"},{"funder":"https://openalex.org/F4320322554","funder_display_name":"Javna Agencija za Raziskovalno Dejavnost RS","award_id":"J1-9110"},{"funder":"https://openalex.org/F4320322554","funder_display_name":"Javna Agencija za Raziskovalno Dejavnost RS","award_id":"P1-0285"},{"funder":"https://openalex.org/F4320322554","funder_display_name":"Javna Agencija za Raziskovalno Dejavnost RS","award_id":"BI-DE/19-20-04"},{"funder":"https://openalex.org/F4320322554","funder_display_name":"Javna Agencija za Raziskovalno Dejavnost RS","award_id":"BI-DE/17-19-18"},{"funder":"https://openalex.org/F4320332999","funder_display_name":"Horizon 2020 Framework Programme","award_id":"739574"}],"datasets":[],"versions":[],"referenced_works_count":23,"referenced_works":["https://openalex.org/W1967688579","https://openalex.org/W1981097305","https://openalex.org/W1986137691","https://openalex.org/W1987374783","https://openalex.org/W1991477862","https://openalex.org/W1998389851","https://openalex.org/W2002055996","https://openalex.org/W2023468831","https://openalex.org/W2032370604","https://openalex.org/W2044124066","https://openalex.org/W2049327803","https://openalex.org/W2065769612","https://openalex.org/W2070838692","https://openalex.org/W2080222130","https://openalex.org/W2085467310","https://openalex.org/W2086119402","https://openalex.org/W2086423153","https://openalex.org/W2094865430","https://openalex.org/W2118382442","https://openalex.org/W2129906574","https://openalex.org/W2149342630","https://openalex.org/W2161426837","https://openalex.org/W2193295754"],"related_works":["https://openalex.org/W4302354937","https://openalex.org/W3181624001","https://openalex.org/W3174133701","https://openalex.org/W3135985610","https://openalex.org/W3098335909","https://openalex.org/W2120739134","https://openalex.org/W2107087931","https://openalex.org/W2037710955","https://openalex.org/W1999772761","https://openalex.org/W1904263529"],"abstract_inverted_index":{"Graph":[0],"searches":[1],"and":[2,12,64,173],"the":[3,49,78,103,135,154],"corresponding":[4],"search":[5,33,38,61,67,75,130,136],"trees":[6,63,186],"can":[7,139],"exhibit":[8],"important":[9],"structural":[10],"properties":[11],"are":[13],"used":[14],"in":[15,46,77,116,142],"various":[16],"graph":[17,30,41],"algorithms.":[18],"The":[19],"problem":[20,54,138,158],"of":[21,28,35,148,185],"deciding":[22],"whether":[23],"a":[24,29,32,36,74],"given":[25],"spanning":[26],"tree":[27,34,76,137],"is":[31,55,159],"particular":[37],"on":[39,102,187],"this":[40,53,97,120,125],"was":[42],"introduced":[43],"by":[44,86],"Hagerup":[45],"1985,":[47],"where":[48],"author":[50],"showed":[51],"that":[52,134],"efficiently":[56],"solvable":[57],"for":[58,83,145,161,182],"depth":[59,150,167],"first":[60,66,92,151,164,168],"(DFS)":[62],"breadth":[65,163],"(BFS)":[68],"trees.":[69],"If":[70],"one":[71],"defines":[72],"such":[73],"same":[79],"way":[80],"as":[81],"done":[82],"BFS,":[84],"i.e.,":[85],"connecting":[87],"every":[88],"vertex":[89],"to":[90],"its":[91,110],"neighbor,":[93],"then":[94],"we":[95,106,118,127,178],"call":[96,119],"an":[98,121],"${\\cal":[99,122,146,155],"F}$-tree.":[100],"If,":[101],"other":[104],"hand,":[105],"connect":[107],"it":[108],"with":[109],"most":[111],"recently":[112],"visited":[113],"neighbor":[114],"(as":[115],"DFS)":[117],"L}$-tree.":[123],"In":[124],"paper,":[126],"consider":[128],"related":[129],"paradigms.":[131],"We":[132],"prove":[133],"be":[140],"solved":[141],"polynomial":[143,180],"time":[144],"L}$-trees":[147],"lexicographic":[149,162,166],"search,":[152,165,169,172],"whereas":[153],"F}$-tree":[156],"recognition":[157],"$\\mathcal{NP}$-complete":[160],"maximum":[170],"cardinality":[171],"maximal":[174],"neighborhood":[175],"search.":[176],"Furthermore,":[177],"present":[179],"results":[181],"both":[183],"types":[184],"chordal":[188],"graphs.":[189]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W3174133701","counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2}],"updated_date":"2025-03-26T20:08:03.055426","created_date":"2021-07-05"}