{"title":"他的父亲是一名律师，母亲是一名律师。","authors":"P. Kopriva, P. Tvrdík","doi":"10.1109/ICPADS.1998.741136","DOIUrl":null,"url":null,"abstract":"This paper deals with problems of decomposition of de Bruijn graph into isomorphic building blocks based on cover sets. The aim is to find so called lowest-cost cover sets which provide decompositions into building blocks with minimal number of external edges. We present formulae for the costs of basic covers. We give new results on the lowest-cost cover set design. We also give new results on the topology of graphs of building blocks based on basic cover sets. We also discuss several open problems.","PeriodicalId":226947,"journal":{"name":"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1998-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Decompositions of de Bruijn networks\",\"authors\":\"P. Kopriva, P. Tvrdík\",\"doi\":\"10.1109/ICPADS.1998.741136\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper deals with problems of decomposition of de Bruijn graph into isomorphic building blocks based on cover sets. The aim is to find so called lowest-cost cover sets which provide decompositions into building blocks with minimal number of external edges. We present formulae for the costs of basic covers. We give new results on the lowest-cost cover set design. We also give new results on the topology of graphs of building blocks based on basic cover sets. We also discuss several open problems.\",\"PeriodicalId\":226947,\"journal\":{\"name\":\"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-12-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPADS.1998.741136\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPADS.1998.741136","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This paper deals with problems of decomposition of de Bruijn graph into isomorphic building blocks based on cover sets. The aim is to find so called lowest-cost cover sets which provide decompositions into building blocks with minimal number of external edges. We present formulae for the costs of basic covers. We give new results on the lowest-cost cover set design. We also give new results on the topology of graphs of building blocks based on basic cover sets. We also discuss several open problems.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
