阻塞有向图中选定边的分解算法

Annals of Biostatistics & Biometric Applications Pub Date : 2019-10-22 DOI:10.33552/abba.2019.03.000562

Tsitsiashvili Gurami

{"title":"阻塞有向图中选定边的分解算法","authors":"Tsitsiashvili Gurami","doi":"10.33552/abba.2019.03.000562","DOIUrl":null,"url":null,"abstract":"Take all nodes from the subset / U and all edges between them. These nodes and edges create directed sub-graph / G G ⊆ . Replace all (directed) edges of the sub-graph / G by undirected ones and obtain undirected graph / / G . Define in the sub-graph / / G all its connectivity components / / / / 1,..., . n G G Return directions to all edges of the subgraph / k G and define in such a way the sub-graph k G of the digraph , 1,..., . G k n =","PeriodicalId":434648,"journal":{"name":"Annals of Biostatistics & Biometric Applications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Decomposition Algorithms of Blocking the Selected Edges in the Digraph\",\"authors\":\"Tsitsiashvili Gurami\",\"doi\":\"10.33552/abba.2019.03.000562\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Take all nodes from the subset / U and all edges between them. These nodes and edges create directed sub-graph / G G ⊆ . Replace all (directed) edges of the sub-graph / G by undirected ones and obtain undirected graph / / G . Define in the sub-graph / / G all its connectivity components / / / / 1,..., . n G G Return directions to all edges of the subgraph / k G and define in such a way the sub-graph k G of the digraph , 1,..., . G k n =\",\"PeriodicalId\":434648,\"journal\":{\"name\":\"Annals of Biostatistics & Biometric Applications\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-10-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Annals of Biostatistics & Biometric Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.33552/abba.2019.03.000562\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of Biostatistics & Biometric Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.33552/abba.2019.03.000562","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

取子集/ U中的所有节点及其之间的所有边。这些节点和边构成有向子图/ G G。将子图/ G的所有(有向)边替换为无向边，得到无向图/ / G。在子图/ / G中定义所有的连接性组件/ / / / 1，…，． n G G返回子图的所有边的方向/ k G，并以这种方式定义有向图的子图k G, 1，…，． gkn =

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

查看原文本刊更多论文

Decomposition Algorithms of Blocking the Selected Edges in the Digraph

Take all nodes from the subset / U and all edges between them. These nodes and edges create directed sub-graph / G G ⊆ . Replace all (directed) edges of the sub-graph / G by undirected ones and obtain undirected graph / / G . Define in the sub-graph / / G all its connectivity components / / / / 1,..., . n G G Return directions to all edges of the subgraph / k G and define in such a way the sub-graph k G of the digraph , 1,..., . G k n =

求助全文

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

来源期刊

Annals of Biostatistics & Biometric Applications

自引率

0.00%

发文量