{"title":"基于图形绘制算法的模块放置","authors":"Meththa Samaranayake, Helen Ji, J. Ainscough","doi":"10.1109/ISSCS.2009.5206087","DOIUrl":null,"url":null,"abstract":"Graph drawing is one of the most straightforward methods of representing a network. This paper would like to explore the possibility of modifying existing graph drawing algorithms for the purpose of module placement. Possible changes and results of those changes are discussed, as well as a performance comparison with a leading academic placement tool.","PeriodicalId":277587,"journal":{"name":"2009 International Symposium on Signals, Circuits and Systems","volume":"190 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Graph drawing alogorithms based module placement\",\"authors\":\"Meththa Samaranayake, Helen Ji, J. Ainscough\",\"doi\":\"10.1109/ISSCS.2009.5206087\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Graph drawing is one of the most straightforward methods of representing a network. This paper would like to explore the possibility of modifying existing graph drawing algorithms for the purpose of module placement. Possible changes and results of those changes are discussed, as well as a performance comparison with a leading academic placement tool.\",\"PeriodicalId\":277587,\"journal\":{\"name\":\"2009 International Symposium on Signals, Circuits and Systems\",\"volume\":\"190 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-07-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Symposium on Signals, Circuits and Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISSCS.2009.5206087\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Symposium on Signals, Circuits and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISSCS.2009.5206087","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Graph drawing is one of the most straightforward methods of representing a network. This paper would like to explore the possibility of modifying existing graph drawing algorithms for the purpose of module placement. Possible changes and results of those changes are discussed, as well as a performance comparison with a leading academic placement tool.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
