{"id":"https://openalex.org/W2026493143","doi":"https://doi.org/10.1145/1877714.1877718","title":"Monadic second order logic on graphs with local cardinality constraints","display_name":"Monadic second order logic on graphs with local cardinality constraints","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2026493143","doi":"https://doi.org/10.1145/1877714.1877718","mag":"2026493143"},"language":"en","primary_location":{"id":"doi:10.1145/1877714.1877718","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1877714.1877718","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","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/A5037092803","display_name":"Stefan Szeider","orcid":"https://orcid.org/0000-0001-8994-1656"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Stefan Szeider","raw_affiliation_strings":["Vienna University of Technology, Vienna, Austria","Vienna University of technology, Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"Vienna University of Technology, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]},{"raw_affiliation_string":"Vienna University of technology, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5037092803"],"corresponding_institution_ids":["https://openalex.org/I145847075"],"apc_list":null,"apc_paid":null,"fwci":3.1385,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.91487568,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"12","issue":"2","first_page":"1","last_page":"21"},"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/T11567","display_name":"semigroups and automata theory","score":0.9868000149726868,"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/T10142","display_name":"Formal Methods in Verification","score":0.9836000204086304,"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/treewidth","display_name":"Treewidth","score":0.8448702692985535},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7530210018157959},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6994866132736206},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5834180116653442},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5735155940055847},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5393646955490112},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.501969575881958},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42468899488449097},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.41587454080581665},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.3783669173717499},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3675546646118164},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1358061134815216}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.8448702692985535},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7530210018157959},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6994866132736206},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5834180116653442},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5735155940055847},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5393646955490112},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.501969575881958},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42468899488449097},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.41587454080581665},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.3783669173717499},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3675546646118164},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1358061134815216},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0},{"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/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1877714.1877718","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1877714.1877718","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1002097251","display_name":null,"funder_award_id":"239962","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"}],"funders":[{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W36639738","https://openalex.org/W143512583","https://openalex.org/W1486674860","https://openalex.org/W1490858874","https://openalex.org/W1517036688","https://openalex.org/W1570425181","https://openalex.org/W2011039300","https://openalex.org/W2035020702","https://openalex.org/W2054076729","https://openalex.org/W2059372025","https://openalex.org/W2064796716","https://openalex.org/W2066585576","https://openalex.org/W2077574397","https://openalex.org/W2080846906","https://openalex.org/W2081414924","https://openalex.org/W2085550081","https://openalex.org/W2087083200","https://openalex.org/W2087348204","https://openalex.org/W2123103890","https://openalex.org/W2140465653","https://openalex.org/W2156856270","https://openalex.org/W2171103562","https://openalex.org/W2401216365","https://openalex.org/W2748837517","https://openalex.org/W2913688336","https://openalex.org/W4213368513","https://openalex.org/W4229647732","https://openalex.org/W4242565038","https://openalex.org/W4256646394","https://openalex.org/W4285719527","https://openalex.org/W4292230561"],"related_works":["https://openalex.org/W1511821218","https://openalex.org/W239742334","https://openalex.org/W1587078595","https://openalex.org/W2124176527","https://openalex.org/W1480846237","https://openalex.org/W1544821268","https://openalex.org/W1548014395","https://openalex.org/W3037533092","https://openalex.org/W1726008105","https://openalex.org/W2584187496"],"abstract_inverted_index":{"We":[0,82,117],"introduce":[1],"the":[2,11,66,77,106],"class":[3,137],"of":[4,10,23,30,38,42,64,68,109,114,123,129,138,160],"MSO-LCC":[5,100,110,139],"problems,":[6,140],"which":[7],"are":[8,144,150],"problems":[9,88,111],"following":[12],"form.":[13],"Given":[14],"a":[15,25,35,49,124,134],"graph":[16],"G":[17,24,43,65],"and":[18,58],"for":[19,60,112,158],"each":[20,61],"vertex":[21,62],"v":[22,28,63,74,80],"set":[26,36,78],"\u03b1(":[27,79],")":[29],"non-negative":[31],"integers.":[32],"Is":[33],"there":[34],"S":[37,47,71],"vertices":[39],"or":[40],"edges":[41],"such":[44,89],"that,":[45],"(1)":[46],"satisfies":[48],"fixed":[50],"property":[51],"expressible":[52],"in":[53,70],"monadic":[54],"second":[55],"order":[56],"logic,":[57],"(2)":[59],"number":[67],"vertices/edges":[69],"adjacent/incident":[72],"with":[73],"belongs":[75],"to":[76,146],")?":[81],"demonstrate":[83],"that":[84,133,149],"several":[85],"hard":[86],"combinatorial":[87],"as":[90,99],"Lov\u00e1sz's":[91],"General":[92],"Factor":[93],"Problem":[94],"can":[95],"be":[96],"naturally":[97],"formulated":[98],"problems.":[101],"Our":[102],"main":[103],"result":[104,120],"is":[105],"polynomial-time":[107,156],"tractability":[108,157],"graphs":[113,159],"bounded":[115,161],"treewidth.":[116],"obtain":[118],"this":[119],"by":[121],"means":[122],"tree-automata":[125],"approach.":[126],"By":[127],"way":[128],"contrast":[130],"we":[131],"show":[132],"more":[135],"general":[136],"where":[141],"cardinality":[142],"constraints":[143],"applied":[145],"second-order":[147],"variables":[148],"arbitrarily":[151],"quantified,":[152],"does":[153],"not":[154],"admit":[155],"treewidth":[162],"unless":[163],"P=NP.":[164]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}