{"id":"https://openalex.org/W1540768932","doi":"https://doi.org/10.1007/978-3-642-20877-5_47","title":"Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width","display_name":"Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W1540768932","doi":"https://doi.org/10.1007/978-3-642-20877-5_47","mag":"1540768932"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-20877-5_47","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-20877-5_47","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1806.00791","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036098436","display_name":"Benjamin Hellouin de M\u00e9nibus","orcid":"https://orcid.org/0000-0001-5194-929X"},"institutions":[{"id":"https://openalex.org/I113428412","display_name":"\u00c9cole Normale Sup\u00e9rieure de Lyon","ror":"https://ror.org/04zmssz18","country_code":"FR","type":"education","lineage":["https://openalex.org/I113428412","https://openalex.org/I203339264"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Benjamin Hellouin de Menibus","raw_affiliation_strings":["ENS Lyon, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ENS Lyon, France","institution_ids":["https://openalex.org/I113428412"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076101253","display_name":"Takeaki Uno","orcid":"https://orcid.org/0000-0001-7274-279X"},"institutions":[{"id":"https://openalex.org/I184597095","display_name":"National Institute of Informatics","ror":"https://ror.org/04ksd4g47","country_code":"JP","type":"facility","lineage":["https://openalex.org/I1319490839","https://openalex.org/I184597095","https://openalex.org/I4210158934"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Takeaki Uno","raw_affiliation_strings":["National Institute of Informatics, Tokyo, 101\u20138430, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Institute of Informatics, Tokyo, 101\u20138430, Japan","institution_ids":["https://openalex.org/I184597095"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.2873,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.44416583,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"483","last_page":"494"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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.9986000061035156,"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/T12288","display_name":"Optimization and Search Problems","score":0.9939000010490417,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/time-complexity","display_name":"Time complexity","score":0.7337369918823242},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7315194010734558},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5991040468215942},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5988603234291077},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.597999095916748},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.5598499178886414},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5215606689453125},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.49249228835105896},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.49166542291641235},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46194180846214294},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4409187138080597},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.4242740869522095},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.42340216040611267},{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.4214681088924408},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.41021695733070374},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.3393346667289734},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.22226396203041077},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.21217447519302368},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.12982529401779175},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.128734290599823}],"concepts":[{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.7337369918823242},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7315194010734558},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5991040468215942},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5988603234291077},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.597999095916748},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.5598499178886414},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5215606689453125},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.49249228835105896},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.49166542291641235},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46194180846214294},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4409187138080597},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.4242740869522095},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.42340216040611267},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.4214681088924408},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.41021695733070374},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.3393346667289734},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.22226396203041077},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.21217447519302368},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.12982529401779175},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.128734290599823},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-642-20877-5_47","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-20877-5_47","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:arXiv.org:1806.00791","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1806.00791","pdf_url":"https://arxiv.org/pdf/1806.00791","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1806.00791","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1806.00791","pdf_url":"https://arxiv.org/pdf/1806.00791","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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"},"sustainable_development_goals":[{"score":0.5600000023841858,"display_name":"Life in Land","id":"https://metadata.un.org/sdg/15"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W163370848","https://openalex.org/W1524888420","https://openalex.org/W1586239617","https://openalex.org/W1586912793","https://openalex.org/W1605448391","https://openalex.org/W1971857477","https://openalex.org/W1976120600","https://openalex.org/W1982250981","https://openalex.org/W1993328543","https://openalex.org/W1994887153","https://openalex.org/W2006912660","https://openalex.org/W2012041962","https://openalex.org/W2019880676","https://openalex.org/W2023652218","https://openalex.org/W2041910029","https://openalex.org/W2044105411","https://openalex.org/W2053991811","https://openalex.org/W2063951771","https://openalex.org/W2064796716","https://openalex.org/W2087911394","https://openalex.org/W2115826669","https://openalex.org/W2143043241","https://openalex.org/W2151864939","https://openalex.org/W3021394452","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2962747312","https://openalex.org/W3135652805","https://openalex.org/W2165678151","https://openalex.org/W2800485060","https://openalex.org/W3022168212","https://openalex.org/W4220735480","https://openalex.org/W2082603400","https://openalex.org/W1584965761","https://openalex.org/W4302399289","https://openalex.org/W4319653989"],"abstract_inverted_index":null,"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-08-05T07:39:15.569665","created_date":"2025-10-10T00:00:00"}