DeepAI AI Chat
Log In Sign Up

2-edge-twinless blocks

by   Raed Jaberi, et al.

Let G=(V,E)) be a directed graph. A 2-edge-twinless block in G is a maximal vertex set C^t⊆ V of with |C^t|>1 such that for any distinct vertices v,w ∈ C^t, and for every edge e∈ E, the vertices v,w are in the same twinless strongly connected component of G∖ e. An edge e in a twinless strongly connected graph is a twinless bridge if the subgraph obtained from G by removing e is not twinless strongly connected. In this paper we show that the 2-edge-twinless blocks of G can be computed in O((b_tn+m)n) time, where b_t is the number of twinless bridges of G.


page 1

page 2

page 3

page 4


2-blocks in strongly biconnected directed graphs

A directed graph G=(V,E) is called strongly biconnected if G is strongly...

Strong Menger connectedness of augmented k-ary n-cubes

A connected graph G is called strongly Menger (edge) connected if for an...

Computing 2-twinless blocks

Let G=(V,E)) be a directed graph. A 2-twinless block in G is a maximal v...

Constant Delay Traversal of Grammar-Compressed Graphs with Bounded Rank

We present a pointer-based data structure for constant time traversal of...

BDD-Based Algorithm for SCC Decomposition of Edge-Coloured Graphs

Edge-coloured directed graphs provide an essential structure for modelli...

Tight Bounds on the Asymptotic Descriptive Complexity of Subgraph Isomorphism

Let v(F) denote the number of vertices in a fixed connected pattern grap...

Asymptotics of the quantization errors for Markov-type measures with complete overlaps

Let 𝒢 be a directed graph with vertices 1,2,…, 2N. Let 𝒯=(T_i,j)_(i,j)∈𝒢...