{"id":"https://openalex.org/W2080998420","doi":"https://doi.org/10.1137/s009753979119607x","title":"The Profile Minimization Problem in Trees","display_name":"The Profile Minimization Problem in Trees","publication_year":1994,"publication_date":"1994-02-01","ids":{"openalex":"https://openalex.org/W2080998420","doi":"https://doi.org/10.1137/s009753979119607x","mag":"2080998420"},"language":"en","primary_location":{"id":"doi:10.1137/s009753979119607x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s009753979119607x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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 Computing","raw_type":"journal-article"},"type":"article","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/A5102124533","display_name":"David Kuo","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"David Kuo","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5002508116","display_name":"Gerard J. Chang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gerard J. Chang","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5102124533"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3908,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.82504129,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"23","issue":"1","first_page":"71","last_page":"81"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":1.0,"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":1.0,"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.9991000294685364,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9988999962806702,"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.8413171768188477},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6782264113426208},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.6648964881896973},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6170642971992493},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5335301160812378},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37637150287628174},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.10977640748023987}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8413171768188477},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6782264113426208},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.6648964881896973},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6170642971992493},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5335301160812378},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37637150287628174},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.10977640748023987}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s009753979119607x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s009753979119607x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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 Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.873.9412","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.873.9412","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://ir.nctu.edu.tw:443/bitstream/11536/2631/1/A1994MZ11700006.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.44999998807907104}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1590241584","https://openalex.org/W1966632753","https://openalex.org/W2012951995","https://openalex.org/W2064535593","https://openalex.org/W2090666691"],"related_works":["https://openalex.org/W2980963558","https://openalex.org/W1882246857","https://openalex.org/W3103304230","https://openalex.org/W2185360082","https://openalex.org/W1992365905","https://openalex.org/W4287664878","https://openalex.org/W3212023493","https://openalex.org/W1991411408","https://openalex.org/W2066456778","https://openalex.org/W4288278856"],"abstract_inverted_index":{"The":[0],"profile":[1],"minimization":[2],"problem":[3,78],"is":[4,42,55,60],"to":[5,20],"find":[6],"a":[7,17,80],"one-to-one":[8],"function":[9],"f":[10],"from":[11],"the":[12,21,61,77],"vertex":[13],"set":[14,22],"$V(G)$":[15],"of":[16,23,64,82],"graph":[18],"G":[19],"all":[24],"positive":[25],"integers":[26],"such":[27],"that":[28],"$\\sum":[29],"_{x":[30],"\\in":[31,38],"V(G)}":[32],"\\{":[33,50,53],"f(x)":[34],"-":[35],"\\min":[36],"_{y":[37],"N[x]}":[39],"f(y)\\}":[40],"$":[41,59],"as":[43,45],"small":[44],"possible,":[46],"where":[47],"$N[x]":[48],"=":[49],"x\\}":[51],"\\cup":[52],"y:y{\\text{":[54],"adjacent":[56],"}}x":[57],"\\}":[58],"closed":[62],"neighborhood":[63],"x":[65],"in":[66,79],"G.":[67],"This":[68],"paper":[69],"gives":[70],"an":[71],"$O(n^{1.722}":[72],")$":[73],"time":[74],"algorithm":[75],"for":[76],"tree":[81],"n":[83],"vertices.":[84]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}