{"id":"https://openalex.org/W2758009167","doi":"https://doi.org/10.23638/lmcs-15(3:2)2019","title":"Capturing Logarithmic Space and Polynomial Time on Chordal Claw-Free Graphs","display_name":"Capturing Logarithmic Space and Polynomial Time on Chordal Claw-Free Graphs","publication_year":2019,"publication_date":"2019-07-08","ids":{"openalex":"https://openalex.org/W2758009167","doi":"https://doi.org/10.23638/lmcs-15(3:2)2019","mag":"2758009167"},"language":"en","primary_location":{"id":"doi:10.23638/lmcs-15(3:2)2019","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-15(3:2)2019","pdf_url":"https://lmcs.episciences.org/5612/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/5612/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012386801","display_name":"Berit Gru\u00dfien","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Berit Gru\u00dfien","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5012386801"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1996,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.49403057,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"Volume 15, Issue 3","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.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/T10142","display_name":"Formal Methods in Verification","score":0.9969000220298767,"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.9957000017166138,"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/chordal-graph","display_name":"Chordal graph","score":0.7892211675643921},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6622874736785889},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5939011573791504},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5396156311035156},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5385632514953613},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.4533017873764038},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.4424520432949066},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4205373227596283},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.4197227358818054},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.38167905807495117},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.27007806301116943},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21895983815193176}],"concepts":[{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.7892211675643921},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6622874736785889},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5939011573791504},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5396156311035156},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5385632514953613},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.4533017873764038},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.4424520432949066},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4205373227596283},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.4197227358818054},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.38167905807495117},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.27007806301116943},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21895983815193176},{"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":3,"locations":[{"id":"doi:10.23638/lmcs-15(3:2)2019","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-15(3:2)2019","pdf_url":"https://lmcs.episciences.org/5612/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:1802.10331","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1802.10331","pdf_url":"https://arxiv.org/pdf/1802.10331","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.1802.10331","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1802.10331","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(3:2)2019","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-15(3:2)2019","pdf_url":"https://lmcs.episciences.org/5612/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/W2758009167.pdf","grobid_xml":"https://content.openalex.org/works/W2758009167.grobid-xml"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W129187698","https://openalex.org/W1482193060","https://openalex.org/W1824706793","https://openalex.org/W1970629906","https://openalex.org/W1978452004","https://openalex.org/W2014767626","https://openalex.org/W2088094394","https://openalex.org/W2097374444","https://openalex.org/W2105787964","https://openalex.org/W2112686605","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/W2964184945","https://openalex.org/W3119976028","https://openalex.org/W3127113455"],"related_works":["https://openalex.org/W2157783000","https://openalex.org/W1480846237","https://openalex.org/W4287117052","https://openalex.org/W4206705200","https://openalex.org/W2788975631","https://openalex.org/W2963009577","https://openalex.org/W1544821268","https://openalex.org/W1548014395","https://openalex.org/W3176308333","https://openalex.org/W3037533092"],"abstract_inverted_index":{"We":[0],"show":[1],"that":[2,16,25,45,89],"the":[3,59,98],"class":[4,60,99],"of":[5,33,61,100],"chordal":[6,62,101],"claw-free":[7,63,102],"graphs":[8],"admits":[9],"LREC$_=$-definable":[10],"canonization.":[11],"LREC$_=$":[12,69,78],"is":[13,79],"a":[14,30,48,54,66],"logic":[15,19,83,91],"extends":[17],"first-order":[18],"with":[20,84,92],"counting":[21,93],"by":[22],"an":[23],"operator":[24,36],"allows":[26],"it":[27],"to":[28],"formalize":[29],"limited":[31],"form":[32],"recursion.":[34],"This":[35],"can":[37],"be":[38],"evaluated":[39],"in":[40,81],"logarithmic":[41,71],"space.":[42],"It":[43],"follows":[44],"there":[46],"exists":[47],"logarithmic-space":[49,55],"canonization":[50],"algorithm,":[51],"and":[52],"therefore":[53],"isomorphism":[56],"test,":[57],"for":[58],"graphs.":[64,103],"As":[65],"further":[67],"consequence,":[68],"captures":[70,94],"space":[72],"on":[73,97],"this":[74],"graph":[75],"class.":[76],"Since":[77],"contained":[80],"fixed-point":[82,90],"counting,":[85],"we":[86],"also":[87],"obtain":[88],"polynomial":[95],"time":[96],"Comment:":[104],"34":[105],"pages,":[106],"13":[107],"figures":[108]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}