{"title":"Ther Are Planar Graphs Almost as Good as the Complete Graphs and as Short as Minimum Spanning Trees","authors":"C. Levcopoulos, A. Lingas","doi":"10.1007/3-540-51859-2_2","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":321589,"journal":{"name":"Optimal Algorithms","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"32","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Optimal Algorithms","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/3-540-51859-2_2","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
