{"title":"All Graphs have Cycle Separators and Planar Directed Depth-First Search is in DNC","authors":"M. Kao","doi":"10.1007/BFb0040373","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":340382,"journal":{"name":"Aegean Workshop on Computing","volume":"55 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"26","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Aegean Workshop on Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/BFb0040373","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
