2-edge-twinless blocks

DOI10.1016/j.bulsci.2021.102969zbMath1461.05100arXiv1912.13347OpenAlexW3133535432MaRDI QIDQ2662356

Raed Jaberi

Publication date: 13 April 2021

Published in: Bulletin des Sciences Mathématiques (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1912.13347

zbMATH Keywords

graph algorithmsdirected graphsstrong bridges2-blockstwinless strongly connected graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (3)

Minimum 2-vertex strongly biconnected spanning directed subgraph problem ⋮ On 2-strong connectivity orientations of mixed graphs and related problems ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• On computing the 2-vertex-connected components of directed graphs
• Finding strong bridges and strong articulation points in linear time
• 2-vertex connectivity in directed graphs
• Finding Strong Bridges and Strong Articulation Points in Linear Time
• 2-Vertex Connectivity in Directed Graphs
• Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time
• Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs
• 2-Edge Connectivity in Directed Graphs
• 2-Connectivity in Directed Graphs: An Experimental Study
• Computing 2-Connected Components and Maximal 2-Connected Subgraphs in Directed Graphs: An Experimental Study
• 2-Edge Connectivity in Directed Graphs
• Computing the 2-blocks of directed graphs
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: 2-edge-twinless blocks