{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T01:05:30Z","timestamp":1729645530831,"version":"3.28.0"},"reference-count":24,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/aiccsa.2005.1387013","type":"proceedings-article","created":{"date-parts":[[2005,4,1]],"date-time":"2005-04-01T20:16:50Z","timestamp":1112386610000},"page":"31-34","source":"Crossref","is-referenced-by-count":0,"title":["Finding maximum-cost minimum spanning trees"],"prefix":"10.1109","author":[{"given":"A.","family":"Belal","sequence":"first","affiliation":[]},{"given":"A.","family":"Elmasry","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1145\/2157.322410"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(83)90006-5"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.2307\/2033241"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(82)90137-5"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(93)90247-7"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1145\/322154.322161"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579443"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1999.1021"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1145\/201019.201022"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1007\/BF02526037"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(93)90082-K"},{"key":"12","first-page":"57","article-title":"O jiste?m proble?mu minima?lnim","volume":"6","author":"jarnik","year":"1930","journal-title":"Pra?ca Moravske? Pr?irodove?decke? Spolec?nosti"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1980.1094690"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/355541.355562"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"key":"2","first-page":"37","article-title":"O jiste?m proble?mu minima?lnim","volume":"3","author":"boruvka","year":"1926","journal-title":"Pra?ca Moravske? Pr?irodove?decke? Spolec?nosti"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1998.743510"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/MAHC.1985.10011"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/225058.225284"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1137\/0221070"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1997.646104"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1137\/0205051"},{"key":"9","first-page":"539","article-title":"Increasing the weight of minimum spanning trees","author":"frederickson","year":"1996","journal-title":"7th ACM-SIAM Symp on Disc Algorith"},{"key":"8","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1016\/0022-0000(93)90040-4","article-title":"Trans-dichotomous algorithms for minimum spanning trees and shortest paths","volume":"48","author":"fredman","year":"1993","journal-title":"J Comput Syst Sci"}],"event":{"name":"The 3rd ACS\/IEEE International Conference onComputer Systems and Applications, 2005.","location":"Cairo, Egypt"},"container-title":["The 3rd ACS\/IEEE International Conference onComputer Systems and Applications, 2005."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9525\/30191\/01387013.pdf?arnumber=1387013","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T17:53:11Z","timestamp":1497635591000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1387013\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/aiccsa.2005.1387013","relation":{},"subject":[]}}