{"id":"https://openalex.org/W2169948211","doi":"https://doi.org/10.1142/s1793830915500184","title":"The maximum weight spanning star forest problem on cactus graphs","display_name":"The maximum weight spanning star forest problem on cactus graphs","publication_year":2015,"publication_date":"2015-03-23","ids":{"openalex":"https://openalex.org/W2169948211","doi":"https://doi.org/10.1142/s1793830915500184","mag":"2169948211"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830915500184","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830915500184","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.sorbonne-universite.fr/hal-01177976","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100686340","display_name":"Vi\u1ebft H\u00f9ng Nguy\u1ec5n","orcid":"https://orcid.org/0000-0003-2181-3847"},"institutions":[{"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/I39804081","display_name":"Sorbonne Universit\u00e9","ror":"https://ror.org/02en5vm52","country_code":"FR","type":"education","lineage":["https://openalex.org/I39804081"]},{"id":"https://openalex.org/I4210159731","display_name":"LIP6","ror":"https://ror.org/05krcen59","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I39804081","https://openalex.org/I4210159245","https://openalex.org/I4210159731"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Viet Hung Nguyen","raw_affiliation_strings":["Sorbonne Universit\u00e9s, UPMC Univ Paris 06, UMR 7606, LIP6, 4 Place Jussieu, Paris, France"],"affiliations":[{"raw_affiliation_string":"Sorbonne Universit\u00e9s, UPMC Univ Paris 06, UMR 7606, LIP6, 4 Place Jussieu, Paris, France","institution_ids":["https://openalex.org/I204730241","https://openalex.org/I39804081","https://openalex.org/I4210159731"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5100686340"],"corresponding_institution_ids":["https://openalex.org/I204730241","https://openalex.org/I39804081","https://openalex.org/I4210159731"],"apc_list":null,"apc_paid":null,"fwci":1.7865,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.88889344,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"07","issue":"02","first_page":"1550018","last_page":"1550018"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T13664","display_name":"Genome Rearrangement Algorithms","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9799000024795532,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8197542428970337},{"id":"https://openalex.org/keywords/star","display_name":"Star (game theory)","score":0.7305775284767151},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7284820079803467},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6574323177337646},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.6433286070823669},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5183578133583069},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.5138199925422668},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4805793762207031},{"id":"https://openalex.org/keywords/a*-search-algorithm","display_name":"A* search algorithm","score":0.4696490168571472},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3690963387489319}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8197542428970337},{"id":"https://openalex.org/C2780897414","wikidata":"https://www.wikidata.org/wiki/Q7600592","display_name":"Star (game theory)","level":2,"score":0.7305775284767151},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7284820079803467},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6574323177337646},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.6433286070823669},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5183578133583069},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.5138199925422668},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4805793762207031},{"id":"https://openalex.org/C103578098","wikidata":"https://www.wikidata.org/wiki/Q277680","display_name":"A* search algorithm","level":2,"score":0.4696490168571472},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3690963387489319},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s1793830915500184","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830915500184","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-01177976v1","is_oa":true,"landing_page_url":"https://hal.sorbonne-universite.fr/hal-01177976","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Discrete Mathematics, Algorithms and Applications, 2015, 07 (02), pp.1550018. ⟨10.1142/S1793830915500184⟩","raw_type":"Journal articles"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-01177976v1","is_oa":true,"landing_page_url":"https://hal.sorbonne-universite.fr/hal-01177976","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Discrete Mathematics, Algorithms and Applications, 2015, 07 (02), pp.1550018. ⟨10.1142/S1793830915500184⟩","raw_type":"Journal articles"},"sustainable_development_goals":[{"score":0.699999988079071,"display_name":"Life in Land","id":"https://metadata.un.org/sdg/15"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W170534829","https://openalex.org/W1830560292","https://openalex.org/W1983741169","https://openalex.org/W2183620132","https://openalex.org/W3141776272"],"related_works":["https://openalex.org/W2803918337","https://openalex.org/W2349211578","https://openalex.org/W3021529782","https://openalex.org/W2186461377","https://openalex.org/W2407082355","https://openalex.org/W3010374802","https://openalex.org/W3016811403","https://openalex.org/W4387560073","https://openalex.org/W2069416867","https://openalex.org/W1576317141"],"abstract_inverted_index":{"A":[0,25,52],"star":[1,26,54,66,78,145],"is":[2,9,28,36,58,64,83,95,108,183,202],"a":[3,18,29,37,40,59,65,76,118,173,184,191,203],"graph":[4,19,30,42],"in":[5,31,44,113,125],"which":[6,32,45,63],"some":[7],"node":[8],"incident":[10],"with":[11],"every":[12],"edge":[13],"of":[14,20,56,61,71,75,81,89,91,101,104,116],"the":[15,46,69,87,98,114,143,161,164,178,197],"graph,":[16],"i.e.,":[17],"diameter":[21],"at":[22],"most":[23],"2.":[24],"forest":[27,55,67,79,146],"each":[33],"connected":[34,41],"component":[35],"star.":[38],"Given":[39],"G":[43,57,62,82,94,107,182,201],"edges":[47,90,103],"may":[48],"be":[49,86],"weighted":[50],"positively.":[51],"spanning":[53,68,77,121,144],"subgraph":[60],"nodes":[70],"G.":[72,126],"The":[73],"size":[74],"F":[80,92,105],"defined":[84],"to":[85,151],"number":[88],"if":[93,106],"unweighted":[96],"and":[97,139,148,166],"total":[99],"weight":[100],"all":[102],"weighted.":[109],"We":[110],"are":[111],"interested":[112],"problem":[115,147,180,199],"finding":[117],"Maximum":[119],"Weight":[120],"Star":[122],"Forest":[123],"(MWSFP)":[124],"In":[127,186],"[C.":[128],"T.":[129],"Nguyen,":[130],"J.":[131,156],"Shen,":[132],"M.":[133],"Hou,":[134],"L.":[135,140],"Sheng,":[136],"W.":[137],"Miller":[138],"Zhang,":[141],"Approximating":[142],"its":[149,168],"applications":[150],"genomic":[152],"sequence":[153],"alignment,":[154],"SIAM":[155],"Comput.":[157],"38(3)":[158],"(2008)":[159],"946\u2013962],":[160],"authors":[162],"introduced":[163],"MWSFP":[165],"proved":[167],"NP-hardness.":[169],"They":[170],"also":[171],"gave":[172],"polynomial":[174],"time":[175,193],"algorithm":[176,194],"for":[177],"MWSF":[179],"when":[181,200],"tree.":[185],"this":[187],"paper,":[188],"we":[189],"present":[190],"linear":[192],"that":[195],"solves":[196],"MSWF":[198],"cactus.":[204]},"counts_by_year":[{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}