DeepAI AI Chat
Log In Sign Up

Computing 2-twinless blocks

by   Raed Jaberi, et al.

Let G=(V,E)) be a directed graph. A 2-twinless block in G is a maximal vertex set B⊆ V of size at least 2 such that for each pair of distinct vertices x,y ∈ B, and for each vertex w∈ V∖ x,y, the vertices x,y are in the same twinless strongly connected component of G∖ w. In this paper we present an algorithm for computing the 2-twinless blocks of G in O(n^3) time.


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...

2-edge-twinless blocks

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

Algorithm for B-partitions, parameterized complexity of the matrix determinant and permanent

Every square matrix A=(a_uv)∈C^n× n can be represented as a digraph havi...

Arc-disjoint in- and out-branchings rooted at the same vertex in compositions of digraphs

A digraph D=(V, A) has a good pair at a vertex r if D has a pair of arc-...

Graphical parameters for classes of tumbling block graphs

The infinite tumbling block graph is a bipartite graph, where each verte...

On d-panconnected tournaments with large semidegrees

We prove the following new results. (a) Let T be a regular tournament ...

Vertex nomination schemes for membership prediction

Suppose that a graph is realized from a stochastic block model where one...