图搜索、路径宽度、树宽度及相关问题(综述)

{"title":"图搜索、路径宽度、树宽度及相关问题(综述)","authors":"D. Bienstock","doi":"10.1090/dimacs/005/02","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":291966,"journal":{"name":"Reliability Of Computer And Communication Networks","volume":"268 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"130","resultStr":"{\"title\":\"Graph Searching, Path-Width, Tree-Width and Related Problems (A Survey)\",\"authors\":\"D. Bienstock\",\"doi\":\"10.1090/dimacs/005/02\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":291966,\"journal\":{\"name\":\"Reliability Of Computer And Communication Networks\",\"volume\":\"268 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"130\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Reliability Of Computer And Communication Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1090/dimacs/005/02\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Reliability Of Computer And Communication Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1090/dimacs/005/02","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}