{"id":"https://openalex.org/W1599740739","doi":"https://doi.org/10.1007/11561071_70","title":"Greedy Routing in Tree-Decomposed Graphs","display_name":"Greedy Routing in Tree-Decomposed Graphs","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W1599740739","doi":"https://doi.org/10.1007/11561071_70","mag":"1599740739"},"language":"en","primary_location":{"id":"doi:10.1007/11561071_70","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11561071_70","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/A5110465085","display_name":"Pierre Fraigniaud","orcid":null},"institutions":[{"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/I102197404","display_name":"Universit\u00e9 Paris-Sud","ror":"https://ror.org/028rypz17","country_code":"FR","type":"education","lineage":["https://openalex.org/I102197404"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Pierre Fraigniaud","raw_affiliation_strings":["CNRS, University of Paris-Sud, \u00a0","CNRS / University of Paris-Sud"],"affiliations":[{"raw_affiliation_string":"CNRS, University of Paris-Sud, \u00a0","institution_ids":["https://openalex.org/I102197404","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"CNRS / University of Paris-Sud","institution_ids":["https://openalex.org/I102197404","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5110465085"],"corresponding_institution_ids":["https://openalex.org/I102197404","https://openalex.org/I1294671590"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":6.1298,"has_fulltext":false,"cited_by_count":42,"citation_normalized_percentile":{"value":0.97065362,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"791","last_page":"802"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987000226974487,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.7985236048698425},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.7562289237976074},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7385458946228027},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4957664906978607},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.47084662318229675},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.45115363597869873},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.4388246536254883},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4340072274208069},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4253893494606018},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.34501755237579346},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.31041258573532104},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19517695903778076},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.15575233101844788}],"concepts":[{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.7985236048698425},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.7562289237976074},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7385458946228027},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4957664906978607},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47084662318229675},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.45115363597869873},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.4388246536254883},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4340072274208069},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4253893494606018},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34501755237579346},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.31041258573532104},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19517695903778076},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.15575233101844788},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/11561071_70","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11561071_70","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":45,"referenced_works":["https://openalex.org/W575347202","https://openalex.org/W1486176979","https://openalex.org/W1494365340","https://openalex.org/W1537449969","https://openalex.org/W1538293711","https://openalex.org/W1572272766","https://openalex.org/W1573579329","https://openalex.org/W1587867115","https://openalex.org/W1589421353","https://openalex.org/W1605156262","https://openalex.org/W1605448391","https://openalex.org/W1992467531","https://openalex.org/W1998837416","https://openalex.org/W2003998639","https://openalex.org/W2005719338","https://openalex.org/W2018876684","https://openalex.org/W2027562075","https://openalex.org/W2029448190","https://openalex.org/W2047940964","https://openalex.org/W2049609719","https://openalex.org/W2053634345","https://openalex.org/W2056455770","https://openalex.org/W2070497706","https://openalex.org/W2083649025","https://openalex.org/W2088668624","https://openalex.org/W2092119436","https://openalex.org/W2112090702","https://openalex.org/W2128678576","https://openalex.org/W2141830959","https://openalex.org/W2143474538","https://openalex.org/W2147037342","https://openalex.org/W2147952642","https://openalex.org/W2154788235","https://openalex.org/W2158663853","https://openalex.org/W2160405192","https://openalex.org/W2164195254","https://openalex.org/W2238191081","https://openalex.org/W2498316819","https://openalex.org/W2502223741","https://openalex.org/W2612166593","https://openalex.org/W2683405002","https://openalex.org/W2798543290","https://openalex.org/W3102822398","https://openalex.org/W4206328227","https://openalex.org/W4299866835"],"related_works":["https://openalex.org/W2985636744","https://openalex.org/W1587078595","https://openalex.org/W2125058377","https://openalex.org/W1511821218","https://openalex.org/W2175868772","https://openalex.org/W2027388354","https://openalex.org/W1586184743","https://openalex.org/W1485639265","https://openalex.org/W2059372025","https://openalex.org/W1973972417"],"abstract_inverted_index":null,"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}