{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T15:13:39Z","timestamp":1759936419497},"reference-count":7,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Asia Pac. J. Oper. Res."],"published-print":{"date-parts":[[2019,4]]},"abstract":"<jats:p> Let [Formula: see text] be a directed graph associated with a weight [Formula: see text]. For an edge-cut [Formula: see text] of [Formula: see text], the average weight of [Formula: see text] is denoted and defined as [Formula: see text]. An optimal edge-cut with average weight is an edge-cut [Formula: see text] such that [Formula: see text] is maximum among all edge-cuts (or minimum, symmetrically). In this paper, a polynomial algorithm for this problem is proposed for finding an optimal edge-cut in a rooted tree separating the root and the set of all leafs. This algorithm enables us to develop an automatic clustering method with more accurate detection of community output. <\/jats:p>","DOI":"10.1142\/s0217595919400062","type":"journal-article","created":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T08:52:43Z","timestamp":1557305563000},"page":"1940006","source":"Crossref","is-referenced-by-count":1,"title":["Edge-Cuts of Optimal Average Weights"],"prefix":"10.1142","volume":"36","author":[{"given":"Scott","family":"Payne","sequence":"first","affiliation":[{"name":"Department of Mathematics, West Virginia University, Morgantown, WV 28506, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edgar","family":"Fuller","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Florida International University, Miami, FL 33199, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cun-Quan","family":"Zhang","sequence":"additional","affiliation":[{"name":"Department of Mathematics, West Virginia University, Morgantown, WV 28506, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2019,5,8]]},"reference":[{"key":"S0217595919400062BIB001","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2"},{"key":"S0217595919400062BIB002","volume-title":"Introduction to Algorithms","author":"Cormen TH","year":"2009"},{"key":"S0217595919400062BIB003","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1956-045-5"},{"key":"S0217595919400062BIB004","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","volume":"29","author":"Garey MR","year":"1979"},{"key":"S0217595919400062BIB005","doi-asserted-by":"publisher","DOI":"10.1145\/48014.61051"},{"key":"S0217595919400062BIB006","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"S0217595919400062BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2013.09.008"}],"container-title":["Asia-Pacific Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0217595919400062","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:20:52Z","timestamp":1565122852000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0217595919400062"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4]]},"references-count":7,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2019,5,8]]},"published-print":{"date-parts":[[2019,4]]}},"alternative-id":["10.1142\/S0217595919400062"],"URL":"https:\/\/doi.org\/10.1142\/s0217595919400062","relation":{},"ISSN":["0217-5959","1793-7019"],"issn-type":[{"value":"0217-5959","type":"print"},{"value":"1793-7019","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,4]]}}}