{"id":"https://openalex.org/W2154658620","doi":"https://doi.org/10.1111/j.1467-8640.2012.00418.x","title":"A REVIEW OF TREE CONVEX SETS TEST","display_name":"A REVIEW OF TREE CONVEX SETS TEST","publication_year":2012,"publication_date":"2012-04-23","ids":{"openalex":"https://openalex.org/W2154658620","doi":"https://doi.org/10.1111/j.1467-8640.2012.00418.x","mag":"2154658620"},"language":"en","primary_location":{"id":"doi:10.1111/j.1467-8640.2012.00418.x","is_oa":false,"landing_page_url":"https://doi.org/10.1111/j.1467-8640.2012.00418.x","pdf_url":null,"source":{"id":"https://openalex.org/S56561474","display_name":"Computational Intelligence","issn_l":"0824-7935","issn":["0824-7935","1467-8640"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Intelligence","raw_type":"journal-article"},"type":"review","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/A5008923050","display_name":"Forrest Sheng Bao","orcid":"https://orcid.org/0000-0002-5722-5337"},"institutions":[{"id":"https://openalex.org/I12315562","display_name":"Texas Tech University","ror":"https://ror.org/0405mnx93","country_code":"US","type":"education","lineage":["https://openalex.org/I12315562"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Forrest Sheng Bao","raw_affiliation_strings":["Department of Computer Science, Texas Tech University, Lubbock, Texas, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Texas Tech University, Lubbock, Texas, USA","institution_ids":["https://openalex.org/I12315562"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101715531","display_name":"Yuanlin Zhang","orcid":"https://orcid.org/0000-0002-8276-8472"},"institutions":[{"id":"https://openalex.org/I12315562","display_name":"Texas Tech University","ror":"https://ror.org/0405mnx93","country_code":"US","type":"education","lineage":["https://openalex.org/I12315562"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yuanlin Zhang","raw_affiliation_strings":["Department of Computer Science, Texas Tech University, Lubbock, Texas, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Texas Tech University, Lubbock, Texas, USA","institution_ids":["https://openalex.org/I12315562"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":3450,"currency":"USD","value_usd":3450},"apc_paid":null,"fwci":2.2358,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.89162688,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"28","issue":"3","first_page":"358","last_page":"372"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9991999864578247,"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.9991999864578247,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9979000091552734,"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.9939000010490417,"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/mathematics","display_name":"Mathematics","score":0.6124715209007263},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5178247094154358},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.5019257068634033},{"id":"https://openalex.org/keywords/convex-combination","display_name":"Convex combination","score":0.483063280582428},{"id":"https://openalex.org/keywords/convexity","display_name":"Convexity","score":0.4741094708442688},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4562772810459137},{"id":"https://openalex.org/keywords/convex-polytope","display_name":"Convex polytope","score":0.44899386167526245},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.4342888593673706},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.42729076743125916},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40930402278900146},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.37465643882751465},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3625413179397583},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35789579153060913},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.3519742488861084},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.3014411926269531},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.13174563646316528}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6124715209007263},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5178247094154358},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.5019257068634033},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.483063280582428},{"id":"https://openalex.org/C72134830","wikidata":"https://www.wikidata.org/wiki/Q5166524","display_name":"Convexity","level":2,"score":0.4741094708442688},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4562772810459137},{"id":"https://openalex.org/C110943637","wikidata":"https://www.wikidata.org/wiki/Q4129097","display_name":"Convex polytope","level":5,"score":0.44899386167526245},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.4342888593673706},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.42729076743125916},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40930402278900146},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.37465643882751465},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3625413179397583},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35789579153060913},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.3519742488861084},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.3014411926269531},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.13174563646316528},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C106159729","wikidata":"https://www.wikidata.org/wiki/Q2294553","display_name":"Financial economics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1111/j.1467-8640.2012.00418.x","is_oa":false,"landing_page_url":"https://doi.org/10.1111/j.1467-8640.2012.00418.x","pdf_url":null,"source":{"id":"https://openalex.org/S56561474","display_name":"Computational Intelligence","issn_l":"0824-7935","issn":["0824-7935","1467-8640"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Intelligence","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W326611788","https://openalex.org/W1530753374","https://openalex.org/W1541781200","https://openalex.org/W1543455987","https://openalex.org/W1965686263","https://openalex.org/W1991477862","https://openalex.org/W1994520092","https://openalex.org/W1999038767","https://openalex.org/W2024491681","https://openalex.org/W2046649829","https://openalex.org/W2071735110","https://openalex.org/W2072755230","https://openalex.org/W2075198446","https://openalex.org/W2086119402","https://openalex.org/W2087304615","https://openalex.org/W2089465933","https://openalex.org/W2098248004","https://openalex.org/W2104498537","https://openalex.org/W2119456262","https://openalex.org/W2135432705","https://openalex.org/W2148417962","https://openalex.org/W2150132485","https://openalex.org/W2161426837","https://openalex.org/W2163675995","https://openalex.org/W2337098149","https://openalex.org/W2426452510","https://openalex.org/W2752885492","https://openalex.org/W4205960197"],"related_works":["https://openalex.org/W2227684440","https://openalex.org/W956035097","https://openalex.org/W2343659340","https://openalex.org/W1559350420","https://openalex.org/W2359095153","https://openalex.org/W2156833871","https://openalex.org/W2566588687","https://openalex.org/W1521720839","https://openalex.org/W2104520711","https://openalex.org/W2356601751"],"abstract_inverted_index":{"A":[0,29],"collection":[1,30,107],"of":[2,23,32,49,52,57,62,65,72,77,86,89,92,108,146,162],"sets":[3,33,51,75,109,149],"may":[4],"have":[5],"some":[6],"interesting":[7,96],"properties":[8,25],"which":[9,78],"help":[10],"identify":[11],"efficient":[12,101],"algorithms":[13,102],"for":[14,125],"constraint":[15],"satisfaction":[16],"problems":[17],"and":[18,54,150],"combinatorial":[19],"auction":[20],"problems.":[21],"One":[22],"the":[24,47,50,60,87,90,133,137,151,159,163,173],"is":[26,34,59,79,98,110,114,176],"tree":[27,35,42,111,147],"convexity.":[28],"S":[31,53,58],"convex":[36,74,148],"if":[37,118],"we":[38,131],"can":[39],"find":[40,100],"a":[41,63,83,106,121,140,144,180],"T":[43,66],"whose":[44],"nodes":[45,61],"are":[46,136,166],"union":[48,91],"each":[55,76],"set":[56],"subtree":[64],".":[67],"This":[68],"concept":[69],"extends":[70],"that":[71,135,172],"row":[73],"an":[80],"interval":[81],"over":[82],"total":[84],"ordering":[85],"elements":[88],"these":[93],"sets.":[94],"An":[95],"problem":[97],"to":[99,103,139],"test":[104,154,165],"whether":[105],"convex.":[112],"It":[113],"not":[115],"known":[116],"before":[117],"there":[119],"exists":[120],"linear":[122,141,174],"time":[123],"algorithm":[124,175],"this":[126,129],"test.":[127],"In":[128],"paper,":[130],"review":[132],"materials":[134],"key":[138],"algorithm:":[142],"hypergraphs,":[143],"characterization":[145],"acyclic":[152],"hypergraph":[153],"algorithm.":[155,183],"Some":[156,169],"typos":[157],"in":[158],"original":[160],"paper":[161],"acyclicity":[164],"corrected":[167],"here.":[168],"experiments":[170],"show":[171],"significantly":[177],"faster":[178],"than":[179],"well\u2010known":[181],"existing":[182]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}