当前位置: X-MOL 学术Bull. des Sci. Math. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
2-edge-twinless blocks
Bulletin des Sciences Mathématiques ( IF 1.3 ) Pub Date : 2021-03-02 , DOI: 10.1016/j.bulsci.2021.102969
Raed Jaberi

Let G=(V,E) be a directed graph. A 2-edge-twinless block in G is a maximal vertex set CtV with |Ct|>1 such that for any distinct vertices v,wCt, and for every edge eE, the vertices v,w are in the same twinless strongly connected component of G{e}. In this paper we study this concept and describe algorithms for computing 2-edge-twinless blocks.



中文翻译:

2边缘双块

G=伏特E是有向图。在A 2-边缘twinless块ģ是最大顶点集CŤ伏特|CŤ|>1个 这样对于任何不同的顶点 vwCŤ,以及每一个边缘 ËE,顶点 vw 在相同的双胞胎强连接组件中 G{Ë}。在本文中,我们研究了这一概念并描述了用于计算2边双胞胎块的算法。

更新日期:2021-03-04
down
wechat
bug