{"id":"https://openalex.org/W2155920587","doi":"https://doi.org/10.1137/s0895480101397773","title":"A New Lower Bound for Tree-Width Using Maximum Cardinality Search","display_name":"A New Lower Bound for Tree-Width Using Maximum Cardinality Search","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W2155920587","doi":"https://doi.org/10.1137/s0895480101397773","mag":"2155920587"},"language":"en","primary_location":{"id":"doi:10.1137/s0895480101397773","doi":"https://doi.org/10.1137/s0895480101397773","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480101397773","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_core":true,"listed_in":["anvur-scientific","ccf-c","cwts-core","dongbi-b","jufo-2","norway-1","poland-100","russia-white-list-2","vabb-shw"],"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},"parent_works":[],"lineage":["https://openalex.org/W2155920587"],"child_works_count":0,"type":"article","is_traditional":true,"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/A5005530807","display_name":"Brian Lucena","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Brian Lucena","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5005530807"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.7562,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.93144667,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":93,"max":95},"biblio":{"volume":"16","issue":"3","first_page":"345","last_page":"353"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9980000257492065,"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.9980000257492065,"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.0010999999940395355,"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/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.0005000000237487257,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/treewidth","display_name":"treewidth","score":0.9409999847412109},{"id":"https://openalex.org/keywords/lower-bounds","display_name":"lower bounds","score":0.859000027179718},{"id":"https://openalex.org/keywords/markov-random-fields","display_name":"Markov random fields","score":0.7639999985694885},{"id":"https://openalex.org/keywords/probabilistic-graphical-models","display_name":"probabilistic graphical models","score":0.6959999799728394},{"id":"https://openalex.org/keywords/computational-complexity","display_name":"computational complexity","score":0.6620000004768372},{"id":"https://openalex.org/keywords/clique-size","display_name":"clique size","score":0.5049999952316284},{"id":"https://openalex.org/keywords/np-hardness","display_name":"NP-hardness","score":0.8080000281333923}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7466917037963867},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6955044865608215},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.6875269412994385},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6829566955566406},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5151582956314087},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.5144219994544983},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49679043889045715},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.45216596126556396},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.437531977891922},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.4288698434829712},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.42257094383239746},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2592928409576416},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.18557459115982056},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.13934111595153809},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.13775241374969482},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.108428955078125},{"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/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s0895480101397773","doi":"https://doi.org/10.1137/s0895480101397773","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480101397773","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_core":true,"listed_in":["anvur-scientific","ccf-c","cwts-core","dongbi-b","jufo-2","norway-1","poland-100","russia-white-list-2","vabb-shw"],"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.59.9135","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.59.9135","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.aucegypt.edu/academic/maths/Personal/Lucenafiles/SIAM39777.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1585877805","https://openalex.org/W1593793857","https://openalex.org/W1991477862","https://openalex.org/W1992752571","https://openalex.org/W2034501206","https://openalex.org/W2081414924","https://openalex.org/W2085550081","https://openalex.org/W2117812871","https://openalex.org/W2117858425","https://openalex.org/W2163718580"],"related_works":["https://openalex.org/W2581920946","https://openalex.org/W1585877805","https://openalex.org/W2083408803","https://openalex.org/W1990761146","https://openalex.org/W2116793595","https://openalex.org/W4234139813","https://openalex.org/W7098026507","https://openalex.org/W2299294161","https://openalex.org/W2569766286","https://openalex.org/W1506542774"],"abstract_inverted_index":{"The":[0,15],"tree-width":[1,28,34,62],"of":[2,6,17,29,63],"a":[3,52,57,64],"graph":[4,65],"is":[5,24,35,72,76],"great":[7],"importance":[8],"in":[9,12,26,37,89],"applied":[10],"problems":[11,19],"graphical":[13],"models.":[14],"complexity":[16],"inference":[18],"on":[20],"Markov":[21],"random":[22],"fields":[23],"exponential":[25],"the":[27,30,61,86,90],"graph.":[31,91],"However,":[32],"computing":[33],"NP-hard":[36],"general.":[38],"Easily":[39],"computable":[40,74],"upper":[41],"bounds":[42],"exist,":[43],"but":[44],"there":[45],"are":[46],"few":[47],"lower":[48,58],"bounds.":[49],"We":[50],"give":[51],"novel":[53],"technique":[54],"to":[55,78],"compute":[56],"bound":[59,71],"for":[60],"using":[66],"maximum":[67],"cardinality":[68],"search.":[69],"This":[70],"efficiently":[73],"and":[75],"guaranteed":[77],"do":[79],"at":[80],"least":[81],"as":[82,84],"well":[83],"finding":[85],"largest":[87],"clique":[88]},"counts_by_year":[{"year":2015,"cited_by_count":2}],"updated_date":"2026-11-14T11:04:58.165337","created_date":"2016-06-24T00:00:00"}