{"title":"使用高效的净代价函数将网络划分为n个部分","authors":"P. Stravers","doi":"10.1109/EDAC.1991.206385","DOIUrl":null,"url":null,"abstract":"Discusses the generalization of the Fiduccia-Mattheyses linear time bi-partitioning algorithm to a linear-time n-partitioning algorithm. It uses a new heuristic cost function to evaluate the cost of arbitrarily large spanning trees in O(log n) time. Practical experiments show good results.<<ETX>>","PeriodicalId":425087,"journal":{"name":"Proceedings of the European Conference on Design Automation.","volume":"62 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Partitioning a network into n pieces with a time-efficient net cost function\",\"authors\":\"P. Stravers\",\"doi\":\"10.1109/EDAC.1991.206385\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Discusses the generalization of the Fiduccia-Mattheyses linear time bi-partitioning algorithm to a linear-time n-partitioning algorithm. It uses a new heuristic cost function to evaluate the cost of arbitrarily large spanning trees in O(log n) time. Practical experiments show good results.<<ETX>>\",\"PeriodicalId\":425087,\"journal\":{\"name\":\"Proceedings of the European Conference on Design Automation.\",\"volume\":\"62 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-02-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the European Conference on Design Automation.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EDAC.1991.206385\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the European Conference on Design Automation.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EDAC.1991.206385","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Partitioning a network into n pieces with a time-efficient net cost function
Discusses the generalization of the Fiduccia-Mattheyses linear time bi-partitioning algorithm to a linear-time n-partitioning algorithm. It uses a new heuristic cost function to evaluate the cost of arbitrarily large spanning trees in O(log n) time. Practical experiments show good results.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
