2022/07/07 by Raed Jaberi, Jaberi, Raed
Computer Science · Engineering · #Advanced Graph Theory Research #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Interconnection Networks and Systems #Structural Analysis and Optimization
paper · pdf · doi:10.48550/arxiv.2207.03401
openalex publication_date 2022/07/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Wu and Grumbach introduced the concept of strongly biconnected directed graphs. A directed graph G=(V,E) is called strongly biconnected if the directed graph G is strongly connected and the underlying undirected graph of G is biconnected. A strongly biconnected directed graph G=(V,E) is said to be 2- edge strongly biconnected if it has at least three vertices and the directed subgraph (V,E∖\lbrace e\rbrace ) is strongly biconnected for all e ∈ E. Let G=(V,E) be a 2-edge-strongly biconnected directed graph. In this paper we study the problem of computing a minimum size subset H ⊆ E such that the directed subgraph (V,H) is 2- edge strongly biconnected.