发布求助
文献互助 智能选刊 最新文献

Aegean Workshop on Computing最新文献

筛选
英文 中文
Channel Routing with Short Wires 短线通道布线
Aegean Workshop on Computing Pub Date : 1988-06-28 DOI: 10.1007/BFb0040390
M. Kaufmann, I. Tollis
{"title":"Channel Routing with Short Wires","authors":"M. Kaufmann, I. Tollis","doi":"10.1007/BFb0040390","DOIUrl":"https://doi.org/10.1007/BFb0040390","url":null,"abstract":"","PeriodicalId":340382,"journal":{"name":"Aegean Workshop on Computing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133534987","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}
引用次数: 3
Computing a Perfect Matching in a Line Graph 计算线形图中的完美匹配
Aegean Workshop on Computing Pub Date : 1988-06-28 DOI: 10.1007/BFb0040382
J. Naor
{"title":"Computing a Perfect Matching in a Line Graph","authors":"J. Naor","doi":"10.1007/BFb0040382","DOIUrl":"https://doi.org/10.1007/BFb0040382","url":null,"abstract":"","PeriodicalId":340382,"journal":{"name":"Aegean Workshop on Computing","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116345149","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
GRAPH EMBEDDINGS 1988: Recent Breakthroughs, New Directions 图形嵌入1988:最近的突破，新的方向
Aegean Workshop on Computing Pub Date : 1988-03-31 DOI: 10.1007/BFb0040384
A. Rosenberg
{"title":"GRAPH EMBEDDINGS 1988: Recent Breakthroughs, New Directions","authors":"A. Rosenberg","doi":"10.1007/BFb0040384","DOIUrl":"https://doi.org/10.1007/BFb0040384","url":null,"abstract":"","PeriodicalId":340382,"journal":{"name":"Aegean Workshop on Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133570193","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}
引用次数: 29
Parallel Ear Decomposition Search (EDS) and St-Numbering in Graphs (Extended Abstract) 图中的并行耳分解搜索(EDS)与st -编号(扩展摘要)
Aegean Workshop on Computing Pub Date : 1986-08-01 DOI: 10.1007/3-540-16766-8_4
Yael Maon, B. Schieber, U. Vishkin
{"title":"Parallel Ear Decomposition Search (EDS) and St-Numbering in Graphs (Extended Abstract)","authors":"Yael Maon, B. Schieber, U. Vishkin","doi":"10.1007/3-540-16766-8_4","DOIUrl":"https://doi.org/10.1007/3-540-16766-8_4","url":null,"abstract":"","PeriodicalId":340382,"journal":{"name":"Aegean Workshop on Computing","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132396302","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
A Polynomial Algorithm for Recognizing Samll Cutwidth in Hypergraphs 超图小切线宽度识别的多项式算法
Aegean Workshop on Computing Pub Date : 1986-08-01 DOI: 10.1007/3-540-16766-8_23
Z. Miller, I. H. Sudborough
{"title":"A Polynomial Algorithm for Recognizing Samll Cutwidth in Hypergraphs","authors":"Z. Miller, I. H. Sudborough","doi":"10.1007/3-540-16766-8_23","DOIUrl":"https://doi.org/10.1007/3-540-16766-8_23","url":null,"abstract":"","PeriodicalId":340382,"journal":{"name":"Aegean Workshop on Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129744989","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}
引用次数: 3
A Polynomial Algorithm for Recognizing Images of Polyhedra 多面体图像识别的多项式算法
Aegean Workshop on Computing Pub Date : 1986-08-01 DOI: 10.1007/3-540-16766-8_17
L. Kirousis
{"title":"A Polynomial Algorithm for Recognizing Images of Polyhedra","authors":"L. Kirousis","doi":"10.1007/3-540-16766-8_17","DOIUrl":"https://doi.org/10.1007/3-540-16766-8_17","url":null,"abstract":"","PeriodicalId":340382,"journal":{"name":"Aegean Workshop on Computing","volume":"290 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127556837","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}
引用次数: 1
Breaking Symmetry in Synchronous Networks 同步网络中的破缺对称性
Aegean Workshop on Computing Pub Date : 1986-08-01 DOI: 10.1007/3-540-16766-8_3
G. Frederickson, N. Santoro
{"title":"Breaking Symmetry in Synchronous Networks","authors":"G. Frederickson, N. Santoro","doi":"10.1007/3-540-16766-8_3","DOIUrl":"https://doi.org/10.1007/3-540-16766-8_3","url":null,"abstract":"","PeriodicalId":340382,"journal":{"name":"Aegean Workshop on Computing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124070584","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}
引用次数: 13
Linear and Book Embeddings of Graphs 图形的线性嵌入和图书嵌入
Aegean Workshop on Computing Pub Date : 1986-08-01 DOI: 10.1007/3-540-16766-8_20
M. Yannakakis
{"title":"Linear and Book Embeddings of Graphs","authors":"M. Yannakakis","doi":"10.1007/3-540-16766-8_20","DOIUrl":"https://doi.org/10.1007/3-540-16766-8_20","url":null,"abstract":"","PeriodicalId":340382,"journal":{"name":"Aegean Workshop on Computing","volume":"735 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122944096","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}
引用次数: 21
On the Connection Between Hexagonal and Unidirectional Rectangular Systolic Arrays 关于六角形与单向矩形收缩阵列之间的联系
Aegean Workshop on Computing Pub Date : 1986-08-01 DOI: 10.1007/3-540-16766-8_7
G. Rote
{"title":"On the Connection Between Hexagonal and Unidirectional Rectangular Systolic Arrays","authors":"G. Rote","doi":"10.1007/3-540-16766-8_7","DOIUrl":"https://doi.org/10.1007/3-540-16766-8_7","url":null,"abstract":"","PeriodicalId":340382,"journal":{"name":"Aegean Workshop on Computing","volume":"74 2 Pt 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115032174","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}
引用次数: 6
Exploiting Hierarchy in VLSI Design VLSI设计中层次结构的开发
Aegean Workshop on Computing Pub Date : 1986-08-01 DOI: 10.1007/3-540-16766-8_16
Thomas Lengauer
{"title":"Exploiting Hierarchy in VLSI Design","authors":"Thomas Lengauer","doi":"10.1007/3-540-16766-8_16","DOIUrl":"https://doi.org/10.1007/3-540-16766-8_16","url":null,"abstract":"","PeriodicalId":340382,"journal":{"name":"Aegean Workshop on Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129275086","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}
引用次数: 28
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信