{"id":"https://openalex.org/W2167634979","doi":"https://doi.org/10.1109/tai.2003.1250227","title":"Reducing redundancy in the hypertree decomposition scheme","display_name":"Reducing redundancy in the hypertree decomposition scheme","publication_year":2004,"publication_date":"2004-03-01","ids":{"openalex":"https://openalex.org/W2167634979","doi":"https://doi.org/10.1109/tai.2003.1250227","mag":"2167634979"},"language":"en","primary_location":{"id":"doi:10.1109/tai.2003.1250227","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tai.2003.1250227","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 15th IEEE International Conference on Tools with Artificial Intelligence","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5074833091","display_name":"P. Harvey","orcid":"https://orcid.org/0000-0002-6938-0166"},"institutions":[{"id":"https://openalex.org/I204824540","display_name":"University of Wollongong","ror":"https://ror.org/00jtmb277","country_code":"AU","type":"education","lineage":["https://openalex.org/I204824540"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"P. Harvey","raw_affiliation_strings":["Decision Systems Laboratory, School of IT and Computer Science, University of Wollongong, Australia"],"affiliations":[{"raw_affiliation_string":"Decision Systems Laboratory, School of IT and Computer Science, University of Wollongong, Australia","institution_ids":["https://openalex.org/I204824540"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034792852","display_name":"Aditya Ghose","orcid":"https://orcid.org/0000-0002-6175-8726"},"institutions":[{"id":"https://openalex.org/I204824540","display_name":"University of Wollongong","ror":"https://ror.org/00jtmb277","country_code":"AU","type":"education","lineage":["https://openalex.org/I204824540"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"A. Ghose","raw_affiliation_strings":["Decision Systems Laboratory, School of IT and Computer Science, University of Wollongong, Australia"],"affiliations":[{"raw_affiliation_string":"Decision Systems Laboratory, School of IT and Computer Science, University of Wollongong, Australia","institution_ids":["https://openalex.org/I204824540"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5074833091"],"corresponding_institution_ids":["https://openalex.org/I204824540"],"apc_list":null,"apc_paid":null,"fwci":1.2464,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.8495755,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"474","last_page":"481"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9970999956130981,"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.9970999956130981,"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/T10142","display_name":"Formal Methods in Verification","score":0.9818999767303467,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9610000252723694,"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/hyperbolic-tree","display_name":"Hyperbolic tree","score":0.9208322763442993},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.6807020306587219},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6447322964668274},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.5950610637664795},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.5917776226997375},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4596542716026306},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.4379946291446686},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.426433801651001},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41016873717308044},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2951332926750183},{"id":"https://openalex.org/keywords/chemistry","display_name":"Chemistry","score":0.06604060530662537}],"concepts":[{"id":"https://openalex.org/C97654310","wikidata":"https://www.wikidata.org/wiki/Q574023","display_name":"Hyperbolic tree","level":4,"score":0.9208322763442993},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.6807020306587219},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6447322964668274},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.5950610637664795},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.5917776226997375},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4596542716026306},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.4379946291446686},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.426433801651001},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41016873717308044},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2951332926750183},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.06604060530662537},{"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/C70984080","wikidata":"https://www.wikidata.org/wiki/Q2619102","display_name":"Hyperbolic manifold","level":3,"score":0.0},{"id":"https://openalex.org/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C92047909","wikidata":"https://www.wikidata.org/wiki/Q204034","display_name":"Hyperbolic function","level":2,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/tai.2003.1250227","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tai.2003.1250227","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 15th IEEE International Conference on Tools with Artificial Intelligence","raw_type":"proceedings-article"},{"id":"pmh:oai:ro.uow.edu.au:infopapers-1159","is_oa":false,"landing_page_url":"https://ro.uow.edu.au/infopapers/161","pdf_url":null,"source":{"id":"https://openalex.org/S4306400510","display_name":"Research Online (University of Wollongong)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I204824540","host_organization_name":"University of Wollongong","host_organization_lineage":["https://openalex.org/I204824540"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Faculty of Informatics - Papers (Archive)","raw_type":"presentation"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.547.4600","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.547.4600","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dsl.uow.edu.au/~harvey/publications/harvey03reducing.pdf","raw_type":"text"},{"id":"pmh:oai:figshare.com:article/27706929","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"}],"best_oa_location":{"id":"pmh:oai:figshare.com:article/27706929","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W102939475","https://openalex.org/W1511182234","https://openalex.org/W2002478775","https://openalex.org/W2033325972","https://openalex.org/W2034674470","https://openalex.org/W2050882124","https://openalex.org/W2080192364","https://openalex.org/W6604190961","https://openalex.org/W6776626634"],"related_works":["https://openalex.org/W2134402143","https://openalex.org/W5383638","https://openalex.org/W2362150722","https://openalex.org/W4386827690","https://openalex.org/W4313304827","https://openalex.org/W2158985358","https://openalex.org/W1560870503","https://openalex.org/W4232719761","https://openalex.org/W2949642105","https://openalex.org/W156119379"],"abstract_inverted_index":{"Hypertree":[0],"decomposition":[1],"is":[2],"a":[3],"powerful":[4],"technique":[5],"for":[6,41],"transforming":[7],"near-acyclic":[8],"CSPs":[9,14],"into":[10],"acyclic":[11],"CSPs.":[12],"Acyclic":[13],"have":[15],"efficient,":[16],"polynomial":[17],"time":[18],"solving":[19],"techniques,":[20],"and":[21],"so":[22],"these":[23],"conversions":[24],"are":[25],"of":[26],"interest":[27],"to":[28],"the":[29,38],"constraints":[30],"community.":[31],"We":[32],"present":[33],"here":[34],"an":[35,43],"improvement":[36],"on":[37],"opt-k-decomp":[39],"algorithm":[40],"finding":[42],"optimal":[44],"hypertree":[45],"decomposition.":[46]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}