{"id":"https://openalex.org/W1516297517","doi":"https://doi.org/10.1007/978-3-642-11409-0_9","title":"Exact and Parameterized Algorithms for Max Internal Spanning Tree","display_name":"Exact and Parameterized Algorithms for Max Internal Spanning Tree","publication_year":2009,"publication_date":"2009-12-03","ids":{"openalex":"https://openalex.org/W1516297517","doi":"https://doi.org/10.1007/978-3-642-11409-0_9","mag":"1516297517"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-11409-0_9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-11409-0_9","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/A5015688812","display_name":"Henning Fernau","orcid":"https://orcid.org/0000-0002-4444-3220"},"institutions":[{"id":"https://openalex.org/I137932638","display_name":"Trier University of Applied Sciences","ror":"https://ror.org/02e3hdx05","country_code":"DE","type":"education","lineage":["https://openalex.org/I137932638"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Henning Fernau","raw_affiliation_strings":["Univ. Trier, FB 4\u2014Abteilung Informatik, D-54286, Trier, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Univ. Trier, FB 4\u2014Abteilung Informatik, D-54286, Trier, Germany","institution_ids":["https://openalex.org/I137932638"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048738368","display_name":"Serge Gaspers","orcid":"https://orcid.org/0000-0002-6947-9238"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I19894307","display_name":"Universit\u00e9 de Montpellier","ror":"https://ror.org/051escj72","country_code":"FR","type":"education","lineage":["https://openalex.org/I19894307"]},{"id":"https://openalex.org/I4210101743","display_name":"Laboratoire d'Informatique, de Robotique et de Micro\u00e9lectronique de Montpellier","ror":"https://ror.org/013yean28","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I151295451","https://openalex.org/I19894307","https://openalex.org/I4210101743","https://openalex.org/I4210159245","https://openalex.org/I4405261681"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Serge Gaspers","raw_affiliation_strings":["LIRMM \u2013 Univ. of Montpellier 2, CNRS, 34392, Montpellier, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LIRMM \u2013 Univ. of Montpellier 2, CNRS, 34392, Montpellier, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I19894307","https://openalex.org/I4210101743"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034140735","display_name":"Daniel Raible","orcid":null},"institutions":[{"id":"https://openalex.org/I137932638","display_name":"Trier University of Applied Sciences","ror":"https://ror.org/02e3hdx05","country_code":"DE","type":"education","lineage":["https://openalex.org/I137932638"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Daniel Raible","raw_affiliation_strings":["Univ. Trier, FB 4\u2014Abteilung Informatik, D-54286, Trier, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Univ. Trier, FB 4\u2014Abteilung Informatik, D-54286, Trier, Germany","institution_ids":["https://openalex.org/I137932638"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":3.3125,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.92023657,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"100","last_page":"111"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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.9998000264167786,"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.9983000159263611,"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.9958999752998352,"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/spanning-tree","display_name":"Spanning tree","score":0.7025390267372131},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6846621632575989},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.650241494178772},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.518552839756012},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5016069412231445},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.49214619398117065},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4805172383785248},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.4766446053981781},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.47630441188812256},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.4683496356010437},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.45881515741348267},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4530772864818573},{"id":"https://openalex.org/keywords/hamiltonian-path-problem","display_name":"Hamiltonian path problem","score":0.42435234785079956},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38559696078300476},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37278860807418823},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.27468299865722656}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7025390267372131},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6846621632575989},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.650241494178772},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.518552839756012},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5016069412231445},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.49214619398117065},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4805172383785248},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.4766446053981781},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47630441188812256},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.4683496356010437},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.45881515741348267},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4530772864818573},{"id":"https://openalex.org/C104737047","wikidata":"https://www.wikidata.org/wiki/Q987652","display_name":"Hamiltonian path problem","level":4,"score":0.42435234785079956},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38559696078300476},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37278860807418823},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.27468299865722656},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/978-3-642-11409-0_9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-11409-0_9","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:CiteSeerX.psu:10.1.1.168.6530","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.168.6530","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dim.uchile.cl/%7Esgaspers/papers/Wg2009.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.245.7385","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.245.7385","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/0811.1875v3.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:lirmm-00432673v1","is_oa":false,"landing_page_url":"https://hal-lirmm.ccsd.cnrs.fr/lirmm-00432673","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.lirmm.fr/wg2009/","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":46,"referenced_works":["https://openalex.org/W174078831","https://openalex.org/W561119072","https://openalex.org/W1506916381","https://openalex.org/W1513252978","https://openalex.org/W1527254034","https://openalex.org/W1542928981","https://openalex.org/W1560611630","https://openalex.org/W1562509859","https://openalex.org/W1570066579","https://openalex.org/W1593947471","https://openalex.org/W1650071176","https://openalex.org/W1824848400","https://openalex.org/W1880580445","https://openalex.org/W1966931974","https://openalex.org/W1969186119","https://openalex.org/W1971483538","https://openalex.org/W1975286948","https://openalex.org/W1975444413","https://openalex.org/W1976697697","https://openalex.org/W1977061208","https://openalex.org/W1980860702","https://openalex.org/W1986398633","https://openalex.org/W2001868457","https://openalex.org/W2012438638","https://openalex.org/W2013568176","https://openalex.org/W2015963099","https://openalex.org/W2023638076","https://openalex.org/W2026771935","https://openalex.org/W2030996579","https://openalex.org/W2040813792","https://openalex.org/W2045326192","https://openalex.org/W2047470084","https://openalex.org/W2048068744","https://openalex.org/W2059451253","https://openalex.org/W2073025989","https://openalex.org/W2089718638","https://openalex.org/W2116671197","https://openalex.org/W2121015801","https://openalex.org/W2124435154","https://openalex.org/W2133106928","https://openalex.org/W2151732151","https://openalex.org/W2153822011","https://openalex.org/W2165086965","https://openalex.org/W2508797883","https://openalex.org/W2570653565","https://openalex.org/W3023894172"],"related_works":["https://openalex.org/W2387385213","https://openalex.org/W2943635264","https://openalex.org/W2418231958","https://openalex.org/W4380840098","https://openalex.org/W3016811403","https://openalex.org/W2589768050","https://openalex.org/W2099915933","https://openalex.org/W2014991506","https://openalex.org/W88291963","https://openalex.org/W2384589661"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2025-10-10T00:00:00"}