{"id":"https://openalex.org/W2133991688","doi":"https://doi.org/10.37236/153","title":"Evaluating a Weighted Graph Polynomial for Graphs of Bounded Tree-Width","display_name":"Evaluating a Weighted Graph Polynomial for Graphs of Bounded Tree-Width","publication_year":2009,"publication_date":"2009-05-29","ids":{"openalex":"https://openalex.org/W2133991688","doi":"https://doi.org/10.37236/153","mag":"2133991688"},"language":"en","primary_location":{"id":"doi:10.37236/153","is_oa":true,"landing_page_url":"https://doi.org/10.37236/153","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v16i1r64/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v16i1r64/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5064835526","display_name":"Steven D. Noble","orcid":"https://orcid.org/0000-0002-1621-0059"},"institutions":[{"id":"https://openalex.org/I59433898","display_name":"Brunel University of London","ror":"https://ror.org/00dn4t376","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I59433898"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"S. D. Noble","raw_affiliation_strings":["Department of Mathematical Sciences Brunel University Kingston Lane, Uxbridge UB8 3PH, U.K","Brunel University, London"],"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences Brunel University Kingston Lane, Uxbridge UB8 3PH, U.K","institution_ids":[]},{"raw_affiliation_string":"Brunel University, London","institution_ids":["https://openalex.org/I59433898"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5064835526"],"corresponding_institution_ids":["https://openalex.org/I59433898"],"apc_list":null,"apc_paid":null,"fwci":2.4666,"has_fulltext":true,"cited_by_count":14,"citation_normalized_percentile":{"value":0.89191574,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"16","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":1.0,"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":1.0,"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/T11476","display_name":"Graph theory and applications","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.9993000030517578,"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/combinatorics","display_name":"Combinatorics","score":0.845818042755127},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.811206579208374},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5344293117523193},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5037617087364197},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4657355844974518}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.845818042755127},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.811206579208374},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5344293117523193},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5037617087364197},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4657355844974518},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.37236/153","is_oa":true,"landing_page_url":"https://doi.org/10.37236/153","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v16i1r64/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.214.5579","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.214.5579","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.combinatorics.org/Volume_16/PDF/v16i1r64.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.426.3098","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.426.3098","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://bura.brunel.ac.uk/bitstream/2438/3374/3/Evaluating a Weighted Graph Polynomial For Graphs of Bounded Tree-Width.pdf","raw_type":"text"},{"id":"pmh:oai:bura.brunel.ac.uk:2438/3374","is_oa":false,"landing_page_url":"http://bura.brunel.ac.uk/handle/2438/3374","pdf_url":null,"source":{"id":"https://openalex.org/S4306401473","display_name":"Brunel University Research Archive (BURA) (Brunel University London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I59433898","host_organization_name":"Brunel University of London","host_organization_lineage":["https://openalex.org/I59433898"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Research Paper"},{"id":"pmh:oai:eprints.bbk.ac.uk.oai2:50386","is_oa":false,"landing_page_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/view/v16i1r64/pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400466","display_name":"BIROn (Birkbeck, University of London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98259816","host_organization_name":"Birkbeck, University of London","host_organization_lineage":["https://openalex.org/I98259816"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":{"id":"doi:10.37236/153","is_oa":true,"landing_page_url":"https://doi.org/10.37236/153","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v16i1r64/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2133991688.pdf","grobid_xml":"https://content.openalex.org/works/W2133991688.grobid-xml"},"referenced_works_count":34,"referenced_works":["https://openalex.org/W23785690","https://openalex.org/W179577048","https://openalex.org/W188858573","https://openalex.org/W1490370380","https://openalex.org/W1581635849","https://openalex.org/W1655990431","https://openalex.org/W1980950380","https://openalex.org/W1991755800","https://openalex.org/W2005471116","https://openalex.org/W2024291212","https://openalex.org/W2029448190","https://openalex.org/W2032968509","https://openalex.org/W2036740975","https://openalex.org/W2039763834","https://openalex.org/W2050735826","https://openalex.org/W2057137244","https://openalex.org/W2059372025","https://openalex.org/W2080408506","https://openalex.org/W2083605028","https://openalex.org/W2085550081","https://openalex.org/W2086114750","https://openalex.org/W2087966263","https://openalex.org/W2092277386","https://openalex.org/W2092744453","https://openalex.org/W2135776146","https://openalex.org/W2156361153","https://openalex.org/W2159003936","https://openalex.org/W2792187400","https://openalex.org/W2792409874","https://openalex.org/W2792417320","https://openalex.org/W2986773320","https://openalex.org/W3184666341","https://openalex.org/W6637190722","https://openalex.org/W6748796008"],"related_works":["https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W4225152035","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W1587224694","https://openalex.org/W2911598644","https://openalex.org/W2042127053"],"abstract_inverted_index":{"We":[0],"show":[1],"that":[2],"for":[3],"any":[4,20,28],"$k$":[5,26],"there":[6],"is":[7],"a":[8,31],"polynomial":[9,17],"time":[10],"algorithm":[11,37],"to":[12],"evaluate":[13],"the":[14,36],"weighted":[15],"graph":[16,21,32],"$U$":[18],"of":[19],"with":[22,33],"tree-width":[23],"at":[24,27],"most":[25],"point.":[29],"For":[30],"$n$":[34],"vertices,":[35],"requires":[38],"$O(a_k":[39],"n^{2k+3})$":[40],"arithmetical":[41],"operations,":[42],"where":[43],"$a_k$":[44],"depends":[45],"only":[46],"on":[47],"$k$.":[48]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}