{"title":"边着色平面图形的快速并行和顺序算法","authors":"M. Chrobak, M. Yung","doi":"10.1007/BFb0040369","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":340382,"journal":{"name":"Aegean Workshop on Computing","volume":"202 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Fast Parallel and Sequential Algorithms for Edge-Coloring Planar Graphs\",\"authors\":\"M. Chrobak, M. Yung\",\"doi\":\"10.1007/BFb0040369\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":340382,\"journal\":{\"name\":\"Aegean Workshop on Computing\",\"volume\":\"202 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-06-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Aegean Workshop on Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/BFb0040369\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Aegean Workshop on Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/BFb0040369","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}