{"id":"https://openalex.org/W1516348081","doi":"https://doi.org/10.1007/978-3-642-13284-1_19","title":"A Linear Time Algorithm for the Minimum Spanning Caterpillar Problem for Bounded Treewidth Graphs","display_name":"A Linear Time Algorithm for the Minimum Spanning Caterpillar Problem for Bounded Treewidth Graphs","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W1516348081","doi":"https://doi.org/10.1007/978-3-642-13284-1_19","mag":"1516348081"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-13284-1_19","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-13284-1_19","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/A5083519582","display_name":"Michael J. Dinneen","orcid":"https://orcid.org/0000-0001-9977-525X"},"institutions":[{"id":"https://openalex.org/I154130895","display_name":"University of Auckland","ror":"https://ror.org/03b94tp07","country_code":"NZ","type":"education","lineage":["https://openalex.org/I154130895"]}],"countries":["NZ"],"is_corresponding":true,"raw_author_name":"Michael J. Dinneen","raw_affiliation_strings":["Department of Computer Science, The University of Auckland, Auckland, New Zealand","Department of Computer Science The University of Auckland  Auckland New Zealand"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, The University of Auckland, Auckland, New Zealand","institution_ids":["https://openalex.org/I154130895"]},{"raw_affiliation_string":"Department of Computer Science The University of Auckland  Auckland New Zealand","institution_ids":["https://openalex.org/I154130895"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056303385","display_name":"Masoud Khosravani","orcid":null},"institutions":[{"id":"https://openalex.org/I154130895","display_name":"University of Auckland","ror":"https://ror.org/03b94tp07","country_code":"NZ","type":"education","lineage":["https://openalex.org/I154130895"]}],"countries":["NZ"],"is_corresponding":false,"raw_author_name":"Masoud Khosravani","raw_affiliation_strings":["Department of Computer Science, The University of Auckland, Auckland, New Zealand","Department of Computer Science The University of Auckland  Auckland New Zealand"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, The University of Auckland, Auckland, New Zealand","institution_ids":["https://openalex.org/I154130895"]},{"raw_affiliation_string":"Department of Computer Science The University of Auckland  Auckland New Zealand","institution_ids":["https://openalex.org/I154130895"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5083519582"],"corresponding_institution_ids":["https://openalex.org/I154130895"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.0987,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.76087432,"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":"237","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.9995999932289124,"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.9995999932289124,"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.993399977684021,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9632999897003174,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.7528636455535889},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.722292959690094},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7046458721160889},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.5787141919136047},{"id":"https://openalex.org/keywords/reverse-delete-algorithm","display_name":"Reverse-delete algorithm","score":0.5784181952476501},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.5546174645423889},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5431001782417297},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.5281194448471069},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4841926395893097},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.41933512687683105},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37710127234458923},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3510683476924896},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1568712294101715}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.7528636455535889},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.722292959690094},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7046458721160889},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.5787141919136047},{"id":"https://openalex.org/C199346575","wikidata":"https://www.wikidata.org/wiki/Q4925151","display_name":"Reverse-delete algorithm","level":4,"score":0.5784181952476501},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.5546174645423889},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5431001782417297},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.5281194448471069},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4841926395893097},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41933512687683105},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37710127234458923},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3510683476924896},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1568712294101715}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-13284-1_19","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-13284-1_19","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":16,"referenced_works":["https://openalex.org/W114301929","https://openalex.org/W179577048","https://openalex.org/W1527664624","https://openalex.org/W1592452925","https://openalex.org/W1832373781","https://openalex.org/W1974817955","https://openalex.org/W1999752715","https://openalex.org/W2029448190","https://openalex.org/W2043791970","https://openalex.org/W2059372025","https://openalex.org/W2084317027","https://openalex.org/W2100350931","https://openalex.org/W2133241632","https://openalex.org/W2913688336","https://openalex.org/W4285719527","https://openalex.org/W4292230561"],"related_works":["https://openalex.org/W3101457564","https://openalex.org/W2898459690","https://openalex.org/W4380840098","https://openalex.org/W2589768050","https://openalex.org/W2899787781","https://openalex.org/W3011323517","https://openalex.org/W3004327225","https://openalex.org/W4242086819","https://openalex.org/W3152233597","https://openalex.org/W2074214908"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}