{"id":"https://openalex.org/W2127689597","doi":"https://doi.org/10.1007/978-3-642-04128-0_27","title":"Polynomial-Time Algorithm for the Leafage of Chordal Graphs","display_name":"Polynomial-Time Algorithm for the Leafage of Chordal Graphs","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2127689597","doi":"https://doi.org/10.1007/978-3-642-04128-0_27","mag":"2127689597"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-04128-0_27","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-04128-0_27","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":"book-chapter","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/A5022152674","display_name":"Michel Habib","orcid":"https://orcid.org/0000-0002-8564-2314"},"institutions":[{"id":"https://openalex.org/I4210094115","display_name":"Laboratoire d'Informatique Algorithmique: Fondements et Applications","ror":"https://ror.org/00pbqgm18","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I204730241","https://openalex.org/I4210094115","https://openalex.org/I4210159245"]},{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]},{"id":"https://openalex.org/I169173203","display_name":"D\u00e9l\u00e9gation Paris 7","ror":"https://ror.org/00bw5n526","country_code":"FR","type":"government","lineage":["https://openalex.org/I154526488","https://openalex.org/I169173203"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Michel Habib","raw_affiliation_strings":["LIAFA \u2013 CNRS and Universit\u00e9 Paris Diderot \u2013 Paris VII,Case 7014, 75205, Paris Cedex 13, France"],"affiliations":[{"raw_affiliation_string":"LIAFA \u2013 CNRS and Universit\u00e9 Paris Diderot \u2013 Paris VII,Case 7014, 75205, Paris Cedex 13, France","institution_ids":["https://openalex.org/I204730241","https://openalex.org/I4210094115","https://openalex.org/I169173203","https://openalex.org/I1294671590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088991444","display_name":"Juraj Stacho","orcid":null},"institutions":[{"id":"https://openalex.org/I169173203","display_name":"D\u00e9l\u00e9gation Paris 7","ror":"https://ror.org/00bw5n526","country_code":"FR","type":"government","lineage":["https://openalex.org/I154526488","https://openalex.org/I169173203"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]},{"id":"https://openalex.org/I4210094115","display_name":"Laboratoire d'Informatique Algorithmique: Fondements et Applications","ror":"https://ror.org/00pbqgm18","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I204730241","https://openalex.org/I4210094115","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Juraj Stacho","raw_affiliation_strings":["LIAFA \u2013 CNRS and Universit\u00e9 Paris Diderot \u2013 Paris VII,Case 7014, 75205, Paris Cedex 13, France"],"affiliations":[{"raw_affiliation_string":"LIAFA \u2013 CNRS and Universit\u00e9 Paris Diderot \u2013 Paris VII,Case 7014, 75205, Paris Cedex 13, France","institution_ids":["https://openalex.org/I204730241","https://openalex.org/I4210094115","https://openalex.org/I169173203","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5022152674"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I169173203","https://openalex.org/I204730241","https://openalex.org/I4210094115"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.9729,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.87744997,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"290","last_page":"300"},"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9814000129699707,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.978600025177002,"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/chordal-graph","display_name":"Chordal graph","score":0.8328206539154053},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.7194042205810547},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5891038179397583},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5739307403564453},{"id":"https://openalex.org/keywords/gomory\u2013hu-tree","display_name":"Gomory\u2013Hu tree","score":0.5409169793128967},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5385220646858215},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5337142944335938},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.5183878540992737},{"id":"https://openalex.org/keywords/block-graph","display_name":"Block graph","score":0.5089962482452393},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.5068805813789368},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.49574312567710876},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.43593859672546387},{"id":"https://openalex.org/keywords/tree-depth","display_name":"Tree-depth","score":0.4282541871070862},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.41765114665031433},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41379866003990173},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39508017897605896},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3297497630119324},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.2814497649669647},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.19138595461845398},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1647023856639862},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.14400643110275269},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.1050330102443695}],"concepts":[{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.8328206539154053},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.7194042205810547},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5891038179397583},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5739307403564453},{"id":"https://openalex.org/C147517495","wikidata":"https://www.wikidata.org/wiki/Q5581241","display_name":"Gomory\u2013Hu tree","level":5,"score":0.5409169793128967},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5385220646858215},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5337142944335938},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.5183878540992737},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.5089962482452393},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.5068805813789368},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49574312567710876},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.43593859672546387},{"id":"https://openalex.org/C69284658","wikidata":"https://www.wikidata.org/wiki/Q7837500","display_name":"Tree-depth","level":5,"score":0.4282541871070862},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.41765114665031433},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41379866003990173},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39508017897605896},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3297497630119324},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.2814497649669647},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.19138595461845398},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1647023856639862},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.14400643110275269},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.1050330102443695},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-04128-0_27","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-04128-0_27","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1479863711","https://openalex.org/W1493037708","https://openalex.org/W1546874952","https://openalex.org/W1598992176","https://openalex.org/W1978452004","https://openalex.org/W2002624476","https://openalex.org/W2024491681","https://openalex.org/W2059123237","https://openalex.org/W2070719150","https://openalex.org/W2072585366","https://openalex.org/W2089465933","https://openalex.org/W2117848356","https://openalex.org/W2143474538","https://openalex.org/W2477307258","https://openalex.org/W2561675875","https://openalex.org/W2889997227","https://openalex.org/W3141776272","https://openalex.org/W4299866835"],"related_works":["https://openalex.org/W1485639265","https://openalex.org/W2995115154","https://openalex.org/W1574061374","https://openalex.org/W2611872667","https://openalex.org/W2126464568","https://openalex.org/W2012939398","https://openalex.org/W2112686605","https://openalex.org/W1860059046","https://openalex.org/W3213813222","https://openalex.org/W2391304179"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}