{"id":"https://openalex.org/W2003843306","doi":"https://doi.org/10.1016/s0304-3975(98)00306-5","title":"The monadic second-order logic of graphs XI: Hierarchical decompositions of connected graphs","display_name":"The monadic second-order logic of graphs XI: Hierarchical decompositions of connected graphs","publication_year":1999,"publication_date":"1999-08-01","ids":{"openalex":"https://openalex.org/W2003843306","doi":"https://doi.org/10.1016/s0304-3975(98)00306-5","mag":"2003843306"},"language":"en","primary_location":{"id":"doi:10.1016/s0304-3975(98)00306-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(98)00306-5","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-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/A5029244225","display_name":"Bruno Courcelle","orcid":"https://orcid.org/0000-0002-5545-8970"},"institutions":[{"id":"https://openalex.org/I15057530","display_name":"Universit\u00e9 de Bordeaux","ror":"https://ror.org/057qpr032","country_code":"FR","type":"education","lineage":["https://openalex.org/I15057530"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Bruno Courcelle","raw_affiliation_strings":["Univ. Bordeaux-I, France#TAB#"],"affiliations":[{"raw_affiliation_string":"Univ. Bordeaux-I, France#TAB#","institution_ids":["https://openalex.org/I15057530"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5029244225"],"corresponding_institution_ids":["https://openalex.org/I15057530"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":1.4652,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.80902778,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"224","issue":"1-2","first_page":"35","last_page":"58"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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.9997000098228455,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9939000010490417,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9937999844551086,"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/mathematics","display_name":"Mathematics","score":0.7172014713287354},{"id":"https://openalex.org/keywords/monadic-predicate-calculus","display_name":"Monadic predicate calculus","score":0.6738759279251099},{"id":"https://openalex.org/keywords/modular-decomposition","display_name":"Modular decomposition","score":0.6399727463722229},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5830215811729431},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.515663743019104},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.48301801085472107},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.45826229453086853},{"id":"https://openalex.org/keywords/second-order-logic","display_name":"Second-order logic","score":0.4337943196296692},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.4116172790527344},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40697845816612244},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.3758787214756012},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.21832287311553955},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1840185523033142},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1294073462486267},{"id":"https://openalex.org/keywords/higher-order-logic","display_name":"Higher-order logic","score":0.1267220377922058},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.09832119941711426}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7172014713287354},{"id":"https://openalex.org/C124656256","wikidata":"https://www.wikidata.org/wiki/Q6897882","display_name":"Monadic predicate calculus","level":4,"score":0.6738759279251099},{"id":"https://openalex.org/C187407849","wikidata":"https://www.wikidata.org/wiki/Q6889712","display_name":"Modular decomposition","level":5,"score":0.6399727463722229},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5830215811729431},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.515663743019104},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.48301801085472107},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.45826229453086853},{"id":"https://openalex.org/C144791301","wikidata":"https://www.wikidata.org/wiki/Q1548746","display_name":"Second-order logic","level":4,"score":0.4337943196296692},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.4116172790527344},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40697845816612244},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.3758787214756012},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.21832287311553955},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1840185523033142},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1294073462486267},{"id":"https://openalex.org/C169896238","wikidata":"https://www.wikidata.org/wiki/Q1644136","display_name":"Higher-order logic","level":3,"score":0.1267220377922058},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.09832119941711426},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s0304-3975(98)00306-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(98)00306-5","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.47.3972","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.3972","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://dept-info.labri.u-bordeaux.fr/~courcell/Art11.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1563892973","https://openalex.org/W1605019912","https://openalex.org/W1804454173","https://openalex.org/W1980992394","https://openalex.org/W1981539143","https://openalex.org/W1993698725","https://openalex.org/W1996895044","https://openalex.org/W2013967419","https://openalex.org/W2028357390","https://openalex.org/W2028775537","https://openalex.org/W2036648964","https://openalex.org/W2040035445","https://openalex.org/W2059287145","https://openalex.org/W2798588639","https://openalex.org/W4213261136","https://openalex.org/W6628803153","https://openalex.org/W6633621193","https://openalex.org/W6636211381","https://openalex.org/W6638413888"],"related_works":["https://openalex.org/W2135382359","https://openalex.org/W2963206482","https://openalex.org/W3105899476","https://openalex.org/W133962531","https://openalex.org/W1570803253","https://openalex.org/W799170909","https://openalex.org/W2099439930","https://openalex.org/W2963129861","https://openalex.org/W3135732667","https://openalex.org/W2003843306"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}