{"id":"https://openalex.org/W77305285","doi":"https://doi.org/10.1007/978-3-642-20712-9_18","title":"Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width","display_name":"Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W77305285","doi":"https://doi.org/10.1007/978-3-642-20712-9_18","mag":"77305285"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-20712-9_18","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-20712-9_18","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":["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/A5022828497","display_name":"Pinar Heggernes","orcid":"https://orcid.org/0000-0001-9460-4355"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Pinar Heggernes","raw_affiliation_strings":["Department of Informatics, University of Bergen, Norway","Department of Informatics, University of Bergen, Norway,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]},{"raw_affiliation_string":"Department of Informatics, University of Bergen, Norway,","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018511843","display_name":"Daniel Meister","orcid":"https://orcid.org/0000-0002-3149-1442"},"institutions":[{"id":"https://openalex.org/I89864525","display_name":"Universit\u00e4t Trier","ror":"https://ror.org/02778hg05","country_code":"DE","type":"education","lineage":["https://openalex.org/I89864525"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Daniel Meister","raw_affiliation_strings":["Theoretical Computer Science, University of Trier, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Theoretical Computer Science, University of Trier, Germany","institution_ids":["https://openalex.org/I89864525"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069504394","display_name":"Udi Rotics","orcid":null},"institutions":[{"id":"https://openalex.org/I55693919","display_name":"Netanya Academic College","ror":"https://ror.org/03d7p8g51","country_code":"IL","type":"education","lineage":["https://openalex.org/I55693919"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Udi Rotics","raw_affiliation_strings":["Netanya Academic College, Netanya, Israel","Netanya Academic College, Netanya, Israel#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Netanya Academic College, Netanya, Israel","institution_ids":["https://openalex.org/I55693919"]},{"raw_affiliation_string":"Netanya Academic College, Netanya, Israel#TAB#","institution_ids":["https://openalex.org/I55693919"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.4366,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.78335005,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"233","last_page":"246"},"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.9991999864578247,"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.9961000084877014,"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/clique-problem","display_name":"Clique problem","score":0.6105525493621826},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.59259432554245},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.5698620080947876},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5692398548126221},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5263915061950684},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4995150566101074},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.49565112590789795},{"id":"https://openalex.org/keywords/clique-graph","display_name":"Clique graph","score":0.4653651714324951},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4492642879486084},{"id":"https://openalex.org/keywords/split-graph","display_name":"Split graph","score":0.4437046945095062},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4422057569026947},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.44087332487106323},{"id":"https://openalex.org/keywords/block-graph","display_name":"Block graph","score":0.4123494327068329},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3734854459762573},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.29411399364471436},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.2782175540924072},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22068685293197632},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.1394866406917572},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.08213040232658386},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.07117080688476562},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.05109912157058716}],"concepts":[{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.6105525493621826},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.59259432554245},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.5698620080947876},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5692398548126221},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5263915061950684},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4995150566101074},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.49565112590789795},{"id":"https://openalex.org/C189239283","wikidata":"https://www.wikidata.org/wiki/Q17101022","display_name":"Clique graph","level":5,"score":0.4653651714324951},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4492642879486084},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.4437046945095062},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4422057569026947},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.44087332487106323},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.4123494327068329},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3734854459762573},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.29411399364471436},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.2782175540924072},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22068685293197632},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.1394866406917572},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.08213040232658386},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.07117080688476562},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.05109912157058716},{"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":1,"locations":[{"id":"doi:10.1007/978-3-642-20712-9_18","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-20712-9_18","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":22,"referenced_works":["https://openalex.org/W163370848","https://openalex.org/W179520739","https://openalex.org/W1586912793","https://openalex.org/W1822562651","https://openalex.org/W1976120600","https://openalex.org/W1993328543","https://openalex.org/W1994331970","https://openalex.org/W1994887153","https://openalex.org/W2006729834","https://openalex.org/W2015142920","https://openalex.org/W2025013668","https://openalex.org/W2043791970","https://openalex.org/W2046616287","https://openalex.org/W2053991811","https://openalex.org/W2059372025","https://openalex.org/W2063291872","https://openalex.org/W2063951771","https://openalex.org/W2087911394","https://openalex.org/W2097725094","https://openalex.org/W2112067601","https://openalex.org/W2169976284","https://openalex.org/W2491957372"],"related_works":["https://openalex.org/W2219991221","https://openalex.org/W4323075982","https://openalex.org/W2085819431","https://openalex.org/W1539736381","https://openalex.org/W2045519960","https://openalex.org/W154317836","https://openalex.org/W2035637517","https://openalex.org/W3092261709","https://openalex.org/W1933633022","https://openalex.org/W3037934538"],"abstract_inverted_index":null,"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2025-10-10T00:00:00"}