{"title":"Floorplan classification algorithms","authors":"Kun Gao, D. Mehta","doi":"10.1109/ICVD.2004.1261057","DOIUrl":null,"url":null,"abstract":"We present optimal linear time algorithms that determine whether a given general floorplan represented by a q-sequence or twin binary trees is slicing or hierarchical. Experimental results on several benchmarks are presented.","PeriodicalId":262556,"journal":{"name":"17th International Conference on VLSI Design. Proceedings.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"17th International Conference on VLSI Design. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICVD.2004.1261057","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
We present optimal linear time algorithms that determine whether a given general floorplan represented by a q-sequence or twin binary trees is slicing or hierarchical. Experimental results on several benchmarks are presented.