Graph Theory and Algorithms最新文献

筛选
英文 中文
Dividing a system into almost unidirectional blocks 将系统划分为几乎单向的块
Graph Theory and Algorithms Pub Date : 1980-10-24 DOI: 10.1007/3-540-10704-5_1
W. Mayeda
{"title":"Dividing a system into almost unidirectional blocks","authors":"W. Mayeda","doi":"10.1007/3-540-10704-5_1","DOIUrl":"https://doi.org/10.1007/3-540-10704-5_1","url":null,"abstract":"","PeriodicalId":252371,"journal":{"name":"Graph Theory and Algorithms","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1980-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129479700","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The two disjoint path problem and wire routing design 二不相交路径问题及导线布线设计
Graph Theory and Algorithms Pub Date : 1980-10-24 DOI: 10.1007/3-540-10704-5_18
T. Ohtsuki
{"title":"The two disjoint path problem and wire routing design","authors":"T. Ohtsuki","doi":"10.1007/3-540-10704-5_18","DOIUrl":"https://doi.org/10.1007/3-540-10704-5_18","url":null,"abstract":"","PeriodicalId":252371,"journal":{"name":"Graph Theory and Algorithms","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1980-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126782009","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 44
On polynominal time computable problems 关于多标称时间可计算问题
Graph Theory and Algorithms Pub Date : 1980-10-24 DOI: 10.1007/3-540-10704-5_13
T. Kasai, A. Adachi
{"title":"On polynominal time computable problems","authors":"T. Kasai, A. Adachi","doi":"10.1007/3-540-10704-5_13","DOIUrl":"https://doi.org/10.1007/3-540-10704-5_13","url":null,"abstract":"","PeriodicalId":252371,"journal":{"name":"Graph Theory and Algorithms","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1980-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130311681","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Homomorphisms of graphs and their global maps 图及其全局映射的同态
Graph Theory and Algorithms Pub Date : 1900-01-01 DOI: 10.1007/3-540-10704-5_14
Masakazu Nasu
{"title":"Homomorphisms of graphs and their global maps","authors":"Masakazu Nasu","doi":"10.1007/3-540-10704-5_14","DOIUrl":"https://doi.org/10.1007/3-540-10704-5_14","url":null,"abstract":"","PeriodicalId":252371,"journal":{"name":"Graph Theory and Algorithms","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127281880","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Characterization of polyhex graphs as applied to chemistry 应用于化学的多角形图的表征
Graph Theory and Algorithms Pub Date : 1900-01-01 DOI: 10.1007/3-540-10704-5_17
H. Hosoya
{"title":"Characterization of polyhex graphs as applied to chemistry","authors":"H. Hosoya","doi":"10.1007/3-540-10704-5_17","DOIUrl":"https://doi.org/10.1007/3-540-10704-5_17","url":null,"abstract":"","PeriodicalId":252371,"journal":{"name":"Graph Theory and Algorithms","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125716357","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信