{"id":"https://openalex.org/W2743078491","doi":"https://doi.org/10.23638/lmcs-15(1:24)2019","title":"Capturing Polynomial Time using Modular Decomposition","display_name":"Capturing Polynomial Time using Modular Decomposition","publication_year":2019,"publication_date":"2019-03-05","ids":{"openalex":"https://openalex.org/W2743078491","doi":"https://doi.org/10.23638/lmcs-15(1:24)2019","mag":"2743078491"},"language":"en","primary_location":{"id":"doi:10.23638/lmcs-15(1:24)2019","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-15(1:24)2019","pdf_url":"https://lmcs.episciences.org/5256/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/5256/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012386801","display_name":"Berit Gru\u00dfien","orcid":null},"institutions":[{"id":"https://openalex.org/I39343248","display_name":"Humboldt-Universit\u00e4t zu Berlin","ror":"https://ror.org/01hcx6992","country_code":"DE","type":"education","lineage":["https://openalex.org/I39343248"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Berit Gru\u00dfien","raw_affiliation_strings":["Humboldt\u2010University of Berlin\u2028"],"affiliations":[{"raw_affiliation_string":"Humboldt\u2010University of Berlin\u2028","institution_ids":["https://openalex.org/I39343248"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5012386801"],"corresponding_institution_ids":["https://openalex.org/I39343248"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00773608,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"Volume 15, Issue 1","issue":null,"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":0.9998000264167786,"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.9998000264167786,"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.9990000128746033,"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.9973000288009644,"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/modular-decomposition","display_name":"Modular decomposition","score":0.7254733443260193},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7048353552818298},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.6449666023254395},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6116429567337036},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5815792679786682},{"id":"https://openalex.org/keywords/transitive-closure","display_name":"Transitive closure","score":0.528078556060791},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41556066274642944},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.3618057072162628},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.32074111700057983},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.14615759253501892}],"concepts":[{"id":"https://openalex.org/C187407849","wikidata":"https://www.wikidata.org/wiki/Q6889712","display_name":"Modular decomposition","level":5,"score":0.7254733443260193},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7048353552818298},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.6449666023254395},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6116429567337036},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5815792679786682},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.528078556060791},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41556066274642944},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.3618057072162628},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.32074111700057983},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.14615759253501892}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.23638/lmcs-15(1:24)2019","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-15(1:24)2019","pdf_url":"https://lmcs.episciences.org/5256/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1803.11134","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1803.11134","pdf_url":"https://arxiv.org/pdf/1803.11134","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.1803.11134","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1803.11134","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.23638/lmcs-15(1:24)2019","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-15(1:24)2019","pdf_url":"https://lmcs.episciences.org/5256/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2743078491.pdf","grobid_xml":"https://content.openalex.org/works/W2743078491.grobid-xml"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W129187698","https://openalex.org/W189149083","https://openalex.org/W1482193060","https://openalex.org/W1568727548","https://openalex.org/W1576293797","https://openalex.org/W1824706793","https://openalex.org/W1970629906","https://openalex.org/W1974006935","https://openalex.org/W1984890936","https://openalex.org/W2000763343","https://openalex.org/W2019030165","https://openalex.org/W2088094394","https://openalex.org/W2094742636","https://openalex.org/W2112686605","https://openalex.org/W2143474538","https://openalex.org/W2158308328","https://openalex.org/W2165416570","https://openalex.org/W2166162093","https://openalex.org/W2181072414","https://openalex.org/W2290968667","https://openalex.org/W2767237999","https://openalex.org/W2963086889","https://openalex.org/W2963507145","https://openalex.org/W3127113455"],"related_works":["https://openalex.org/W1977862280","https://openalex.org/W2031276298","https://openalex.org/W4288294436","https://openalex.org/W2955095032","https://openalex.org/W2061237693","https://openalex.org/W3130332934","https://openalex.org/W1919313975","https://openalex.org/W2169699292","https://openalex.org/W4293578199","https://openalex.org/W1971319751"],"abstract_inverted_index":{"The":[0,74],"question":[1],"of":[2,14,42,51,99,107,110,113,129,148,154,165,210,217],"whether":[3],"there":[4],"is":[5,12,168,184,197],"a":[6,89,100,122,166],"logic":[7,33,139,174],"that":[8,30,76,95,115,136,161,179,191],"captures":[9,36,142],"polynomial":[10,37,143],"time":[11,38,144],"one":[13],"the":[15,91,108,130,146,152,155,162,180,215,218],"main":[16],"open":[17],"problems":[18],"in":[19,72,170,186,199,214,225],"descriptive":[20],"complexity":[21],"theory":[22],"and":[23,194],"database":[24],"theory.":[25],"In":[26],"2010":[27],"Grohe":[28],"showed":[29],"fixed":[31,137],"point":[32,138],"with":[34,44,53,79,118,140,175],"counting":[35,141],"on":[39,121,145,223],"all":[40],"classes":[41,50],"graphs":[43,52,75,112],"excluded":[45,54],"minors.":[46],"We":[47,87,177],"now":[48],"consider":[49],"induced":[55],"subgraphs.":[56],"For":[57],"such":[58],"graph":[59,63,101,167],"classes,":[60],"an":[61,127],"effective":[62],"decomposition,":[64,67],"called":[65,85],"modular":[66,82,163,181],"was":[68],"introduced":[69],"by":[70],"Gallai":[71],"1976.":[73],"are":[77,84,116],"non-decomposable":[78],"respect":[80],"to":[81,104],"decomposition":[83,164,182],"prime.":[86],"present":[88],"tool,":[90],"Modular":[92,131,156],"Decomposition":[93,132,157],"Theorem,":[94,133,158],"reduces":[96],"(definable)":[97,105],"canonization":[98,106,196],"class":[102,109,147],"C":[103,114],"prime":[111],"colored":[117],"binary":[119],"relations":[120],"linearly":[123],"ordered":[124],"set.":[125],"By":[126],"application":[128],"we":[134,159],"show":[135,160],"permutation":[149],"graphs.":[150],"Within":[151],"proof":[153],"definable":[169],"symmetric":[171],"transitive":[172],"closure":[173],"counting.":[176],"obtain":[178],"tree":[183],"computable":[185,198],"logarithmic":[187,200],"space.":[188,201],"It":[189],"follows":[190],"cograph":[192,195],"recognition":[193],"Comment:":[202],"38":[203],"pages,":[204],"10":[205],"Figures.":[206],"A":[207],"preliminary":[208],"version":[209],"this":[211],"article":[212],"appeared":[213],"Proceedings":[216],"32nd":[219],"Annual":[220],"ACM/IEEE":[221],"Symposium":[222],"Logic":[224],"Computer":[226],"Science":[227],"(LICS":[228],"'17)":[229]},"counts_by_year":[],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}