{"id":"https://openalex.org/W2037362003","doi":"https://doi.org/10.1137/s0895480100374242","title":"Finding a 2-Core of a Tree in Linear Time","display_name":"Finding a 2-Core of a Tree in Linear Time","alternate_titles":[],"publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W2037362003","doi":"https://doi.org/10.1137/s0895480100374242","mag":"2037362003"},"language":"en","primary_location":{"id":"doi:10.1137/s0895480100374242","doi":"https://doi.org/10.1137/s0895480100374242","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480100374242","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","ccf-c","cwts-core","dongbi-b","jufo-2","norway-1","poland-100","russia-white-list-2","vabb-shw"],"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},"parent_works":[],"lineage":["https://openalex.org/W2037362003"],"child_works_count":0,"type":"article","is_traditional":true,"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/A5001316179","display_name":"Biing-Feng Wang","orcid":"https://orcid.org/0000-0002-8109-1914","observed_orcids":["https://orcid.org/0000-0002-8109-1914"]},"institutions":[{"id":"https://openalex.org/I25846049","display_name":"National Tsing Hua University","ror":"https://ror.org/00zdnkx70","country_code":"TW","type":"education","lineage":["https://openalex.org/I25846049"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Biing-Feng Wang","raw_affiliation_strings":["Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan, Republic of China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan, Republic of China","institution_ids":["https://openalex.org/I25846049"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5001316179"],"corresponding_institution_ids":["https://openalex.org/I25846049"],"apc_list":null,"apc_paid":null,"fwci":2.204,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.85754292,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":96},"biblio":{"volume":"15","issue":"2","first_page":"193","last_page":"210"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","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/T10720","display_name":"Complexity and Algorithms in Graphs","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/T10374","display_name":"Advanced Graph Theory Research","score":0.0003000000142492354,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/2-core","display_name":"2-core","score":0.6669999957084656},{"id":"https://openalex.org/keywords/edge-weighted-trees","display_name":"edge-weighted trees","score":0.878000020980835},{"id":"https://openalex.org/keywords/disjoint-paths","display_name":"disjoint paths","score":0.8450000286102295},{"id":"https://openalex.org/keywords/linear-time-algorithms","display_name":"linear-time algorithms","score":0.7620000243186951},{"id":"https://openalex.org/keywords/distance-minimization","display_name":"distance minimization","score":0.6779999732971191},{"id":"https://openalex.org/keywords/parallel-algorithms","display_name":"parallel algorithms","score":0.6129999756813049},{"id":"https://openalex.org/keywords/erew-pram","display_name":"EREW PRAM","score":0.9369999766349792},{"id":"https://openalex.org/keywords/tree-partitioning","display_name":"tree partitioning","score":0.37400001287460327}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7982337474822998},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7161612510681152},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.697129487991333},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5711498260498047},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5595079660415649},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.5393784642219543},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5339644551277161},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5227580070495605},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5184426307678223},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5127885937690735},{"id":"https://openalex.org/C2777002779","wikidata":"https://www.wikidata.org/wiki/Q42478","display_name":"Perl","level":2,"score":0.48716971278190613},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28550267219543457},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.13869404792785645},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","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},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0895480100374242","doi":"https://doi.org/10.1137/s0895480100374242","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480100374242","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","ccf-c","cwts-core","dongbi-b","jufo-2","norway-1","poland-100","russia-white-list-2","vabb-shw"],"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1527658630","https://openalex.org/W1534135413","https://openalex.org/W1535011786","https://openalex.org/W1748827674","https://openalex.org/W1965874601","https://openalex.org/W1968276546","https://openalex.org/W1991466654","https://openalex.org/W1994798705","https://openalex.org/W1995040285","https://openalex.org/W1996896896","https://openalex.org/W1999753357","https://openalex.org/W2030145967","https://openalex.org/W2043869641","https://openalex.org/W2060635739","https://openalex.org/W2064072796","https://openalex.org/W2081385108","https://openalex.org/W2085579980","https://openalex.org/W2085637279","https://openalex.org/W2087785155","https://openalex.org/W2090879820","https://openalex.org/W2092866803","https://openalex.org/W2103145733","https://openalex.org/W2120490947","https://openalex.org/W2121423472","https://openalex.org/W2127859636","https://openalex.org/W2141178123","https://openalex.org/W2157047836","https://openalex.org/W2167328348","https://openalex.org/W2171350309","https://openalex.org/W2752853835","https://openalex.org/W2989713547","https://openalex.org/W4210342397"],"related_works":["https://openalex.org/W1494802580","https://openalex.org/W2087785155","https://openalex.org/W2051616349","https://openalex.org/W2085637279","https://openalex.org/W4210342397","https://openalex.org/W1991466654","https://openalex.org/W1534135413","https://openalex.org/W2064072796","https://openalex.org/W2121423472","https://openalex.org/W2334718128"],"abstract_inverted_index":{"Let":[0],"T":[1,9,19,31],"be":[2,99],"an":[3,43,48],"edge-weighted":[4],"tree.":[5],"A":[6],"p-core":[7],"of":[8,13,24,27,34,65],"is":[10,42,52,62],"a":[11],"set":[12],"p":[14,36,57],"mutually":[15],"disjoint":[16],"paths":[17],"in":[18,30,67,105],"that":[20],"minimizes":[21],"the":[22,25,35,55,63,72,95,102],"sum":[23],"distances":[26],"all":[28],"vertices":[29,66],"from":[32],"any":[33],"paths,":[37],"where":[38,60],"$p":[39],"\\geq":[40],"1$":[41],"integer.":[44],"In":[45],"this":[46],"paper,":[47],"O(n)":[49],"time":[50,77,110],"algorithm":[51,70,97],"proposed":[53,80,96],"for":[54],"case":[56],"=":[58],"2,":[59],"n":[61,108],"number":[64],"T.":[68],"Our":[69],"improves":[71],"two":[73],"O(n":[74,112],"2":[75,107],")":[76,109],"algorithms":[78],"previously":[79],"by":[81],"Becker":[82],"and":[83],"Perl":[84],"[Discrete":[85],"Appl.":[86],"Math.,":[87],"11":[88],"(1985),":[89],"pp.":[90],"103--113].":[91],"With":[92],"some":[93],"modifications,":[94],"can":[98],"implemented":[100],"on":[101],"EREW":[103],"PRAM":[104],"O(log":[106],"using":[111],"log":[113],"n)":[114],"work.":[115]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2037362003","counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
