{"id":"https://openalex.org/W2612955371","doi":"https://doi.org/10.1145/3034786.3056109","title":"Efficiently Enumerating Minimal Triangulations","display_name":"Efficiently Enumerating Minimal Triangulations","publication_year":2017,"publication_date":"2017-05-09","ids":{"openalex":"https://openalex.org/W2612955371","doi":"https://doi.org/10.1145/3034786.3056109","mag":"2612955371"},"language":"en","primary_location":{"id":"doi:10.1145/3034786.3056109","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3034786.3056109","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems","raw_type":"proceedings-article"},"type":"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/A5030337488","display_name":"Nofar Carmeli","orcid":"https://orcid.org/0000-0003-0673-5510"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Nofar Carmeli","raw_affiliation_strings":["Technion -- Israel Institute of Technology, Haifa, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technion -- Israel Institute of Technology, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047636495","display_name":"Batya Kenig","orcid":"https://orcid.org/0000-0001-6349-128X"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Batya Kenig","raw_affiliation_strings":["Technion -- Israel Institute of Technology, Haifa, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technion -- Israel Institute of Technology, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006706357","display_name":"Benny Kimelfeld","orcid":"https://orcid.org/0000-0002-7156-1572"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Benny Kimelfeld","raw_affiliation_strings":["Technion -- Israel Institute of Technology, Haifa, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technion -- Israel Institute of Technology, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I174306211"],"apc_list":null,"apc_paid":null,"fwci":2.3922,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.898015,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"273","last_page":"287"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9950000047683716,"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.9950000047683716,"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.9936000108718872,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9847000241279602,"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/tree-decomposition","display_name":"Tree decomposition","score":0.7161761522293091},{"id":"https://openalex.org/keywords/triangulation","display_name":"Triangulation","score":0.6413944959640503},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.6150758862495422},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5886611938476562},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5866814851760864},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5681746006011963},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5055129528045654},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.49571359157562256},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3709034323692322},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3453693389892578},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.23615822196006775},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.06129094958305359}],"concepts":[{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.7161761522293091},{"id":"https://openalex.org/C135981907","wikidata":"https://www.wikidata.org/wiki/Q188056","display_name":"Triangulation","level":2,"score":0.6413944959640503},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.6150758862495422},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5886611938476562},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5866814851760864},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5681746006011963},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5055129528045654},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49571359157562256},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3709034323692322},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3453693389892578},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.23615822196006775},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.06129094958305359},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3034786.3056109","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3034786.3056109","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W1534549784","https://openalex.org/W1560870503","https://openalex.org/W1570429932","https://openalex.org/W1588395561","https://openalex.org/W1593793857","https://openalex.org/W1966454892","https://openalex.org/W1970792753","https://openalex.org/W1976151205","https://openalex.org/W1978452004","https://openalex.org/W1978544932","https://openalex.org/W1981917097","https://openalex.org/W1983022219","https://openalex.org/W1985733932","https://openalex.org/W1991477862","https://openalex.org/W2002722727","https://openalex.org/W2007940874","https://openalex.org/W2008865455","https://openalex.org/W2026745535","https://openalex.org/W2027566319","https://openalex.org/W2033325972","https://openalex.org/W2035331304","https://openalex.org/W2037106315","https://openalex.org/W2056976531","https://openalex.org/W2058363692","https://openalex.org/W2063694895","https://openalex.org/W2065023965","https://openalex.org/W2085550081","https://openalex.org/W2089941644","https://openalex.org/W2165605193","https://openalex.org/W2165952534","https://openalex.org/W2170602975","https://openalex.org/W2291572755","https://openalex.org/W2295420503","https://openalex.org/W2399695036","https://openalex.org/W2440178963","https://openalex.org/W3022709368","https://openalex.org/W3102544512","https://openalex.org/W3142428054","https://openalex.org/W4254380579","https://openalex.org/W6659287788","https://openalex.org/W6696403533"],"related_works":["https://openalex.org/W768569191","https://openalex.org/W1535358919","https://openalex.org/W4241226487","https://openalex.org/W2370302780","https://openalex.org/W1998175889","https://openalex.org/W2039867343","https://openalex.org/W1493010546","https://openalex.org/W2053583257","https://openalex.org/W3007288445","https://openalex.org/W2224152264"],"abstract_inverted_index":{"We":[0,75],"present":[1],"an":[2,20,67,77,82],"algorithm":[3,21,50,69,95],"that":[4,36,93],"enumerates":[5],"all":[6,24],"the":[7,25,37,94,102],"minimal":[8],"triangulations":[9],"of":[10,81,114],"a":[11,47,73,111],"graph":[12],"in":[13,29],"incremental":[14,30],"polynomial":[15,31],"time.":[16],"Consequently,":[17],"we":[18],"get":[19],"for":[22,55],"enumerating":[23],"proper":[26],"tree":[27,38,61,104],"decompositions,":[28,105],"time,":[32],"where":[33],"``proper''":[34],"means":[35],"decomposition":[39],"cannot":[40],"be":[41],"improved":[42],"by":[43],"removing":[44],"or":[45,60],"splitting":[46],"bag.":[48],"The":[49],"can":[51,64],"incorporate":[52],"any":[53],"method":[54],"(ordinary,":[56],"single":[57],"result)":[58],"triangulation":[59],"decomposition,":[62],"and":[63,106],"serve":[65],"as":[66],"anytime":[68],"to":[70,109],"improve":[71],"such":[72],"method.":[74],"describe":[76],"extensive":[78],"experimental":[79],"study":[80],"implementation":[83],"on":[84],"real":[85],"data":[86],"from":[87],"different":[88],"fields.":[89],"Our":[90],"experiments":[91],"show":[92],"improves":[96],"upon":[97],"central":[98],"quality":[99],"measures":[100],"over":[101],"underlying":[103],"is":[107],"able":[108],"produce":[110],"large":[112],"number":[113],"high-quality":[115],"decompositions.":[116]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":2}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}