关于低交叉数生成树

{"title":"关于低交叉数生成树","authors":"E. Welzl","doi":"10.1007/3-540-55488-2_30","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":117110,"journal":{"name":"Data Structures and Efficient Algorithms","volume":"30 1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"68","resultStr":"{\"title\":\"On Spanning Trees with Low Crossing Numbers\",\"authors\":\"E. Welzl\",\"doi\":\"10.1007/3-540-55488-2_30\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":117110,\"journal\":{\"name\":\"Data Structures and Efficient Algorithms\",\"volume\":\"30 1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"68\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Data Structures and Efficient Algorithms\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/3-540-55488-2_30\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Data Structures and Efficient Algorithms","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/3-540-55488-2_30","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}