{"id":"https://openalex.org/W3214745751","doi":null,"title":"MIN-MAX TREE PARTITIONING.","display_name":"MIN-MAX TREE PARTITIONING.","publication_year":1981,"publication_date":"1981-12-01","ids":{"openalex":"https://openalex.org/W3214745751","mag":"3214745751"},"language":"en","primary_location":{"id":"mag:3214745751","doi":null,"is_oa":false,"landing_page_url":"https://researchwith.njit.edu/en/publications/min-max-tree-partitioning","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"volume":null,"type":"article","indexed_in":[],"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/A5069480667","display_name":"Ronald I. Becker","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ronald I. Becker","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077648725","display_name":"Yehoshua Perl","orcid":"https://orcid.org/0000-0003-1940-9386","observed_orcids":["https://orcid.org/0000-0003-1940-9386"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yehoshua Perl","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-1940-9386","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5113485374","display_name":"S.R. Schach","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"S.R. Schach","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.42313788,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.7621999979019165,"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.7621999979019165,"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/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.032999999821186066,"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/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.02500000037252903,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/tree-partitioning","display_name":"tree partitioning","score":0.9079999923706055},{"id":"https://openalex.org/keywords/min-max-optimization","display_name":"minimax optimization","score":0.7580000162124634},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"tree decomposition","score":0.5019999742507935},{"id":"https://openalex.org/keywords/graph-partitioning","display_name":"graph partitioning","score":0.6859999895095825}],"concepts":[{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.45560023188591003},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40270107984542847},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37702780961990356},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2814609706401825}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:3214745751","doi":null,"is_oa":false,"landing_page_url":"https://researchwith.njit.edu/en/publications/min-max-tree-partitioning","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W63407816","https://openalex.org/W2794140302","https://openalex.org/W107543261","https://openalex.org/W1971764118","https://openalex.org/W7095707188","https://openalex.org/W7099846348","https://openalex.org/W2153225323","https://openalex.org/W2294167298","https://openalex.org/W6941110641","https://openalex.org/W7100096005"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T04:12:42.849631","created_date":"2021-12-06T00:00:00"}