{"title":"Approximate solutions for Graph and Hypergraph Partitioning","authors":"F. Makedon, S. Tragoudas","doi":"10.1142/9789812794468_0004","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":145557,"journal":{"name":"Algorithmic Aspects of VLSI Layout","volume":"108 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Algorithmic Aspects of VLSI Layout","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/9789812794468_0004","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
京公网安备 11010802042870号
求助内容：
应助结果提醒方式：
