一个新的图论方法来选择撕裂

Euro ASIC '91 Pub Date : 1991-05-27 DOI:10.1109/EUASIC.1991.212863

M. Bartholomeus, M. Raith

{"title":"一个新的图论方法来选择撕裂","authors":"M. Bartholomeus, M. Raith","doi":"10.1109/EUASIC.1991.212863","DOIUrl":null,"url":null,"abstract":"Presents a new approach to the selection of rip-ups to be used in a rip-up and reroute router. This technique is based on a hypergraph model. The novelty of the authors' approach is that given a blocking situation, a minimal set of connections to be ripped-up is simultaneously calculated and removed. The selection of the best ripping set is based on its reroutability potential.<<ETX>>","PeriodicalId":118990,"journal":{"name":"Euro ASIC '91","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A new graph theoretical approach to the selection of rip-ups\",\"authors\":\"M. Bartholomeus, M. Raith\",\"doi\":\"10.1109/EUASIC.1991.212863\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Presents a new approach to the selection of rip-ups to be used in a rip-up and reroute router. This technique is based on a hypergraph model. The novelty of the authors' approach is that given a blocking situation, a minimal set of connections to be ripped-up is simultaneously calculated and removed. The selection of the best ripping set is based on its reroutability potential.<<ETX>>\",\"PeriodicalId\":118990,\"journal\":{\"name\":\"Euro ASIC '91\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-05-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Euro ASIC '91\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EUASIC.1991.212863\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Euro ASIC '91","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EUASIC.1991.212863","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

提出了一种用于撕裂和重路由路由器的撕裂选择的新方法。该技术基于超图模型。作者的方法的新颖之处在于，给定阻塞情况，将同时计算和删除要破坏的最小连接集。选择最佳的撕裂集是基于其可复用性潜力。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A new graph theoretical approach to the selection of rip-ups

Presents a new approach to the selection of rip-ups to be used in a rip-up and reroute router. This technique is based on a hypergraph model. The novelty of the authors' approach is that given a blocking situation, a minimal set of connections to be ripped-up is simultaneously calculated and removed. The selection of the best ripping set is based on its reroutability potential.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Euro ASIC '91

自引率

0.00%

发文量