Making bidirected graphs strongly connected

DOI10.1007/s00453-019-00613-5zbMath1441.05127arXiv1709.00824OpenAlexW2966820843MaRDI QIDQ2300723

Tatsuya Matsuoka, Shun Sato

Publication date: 28 February 2020

Published in: Algorithmica (Search for Journal in Brave)

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

zbMATH Keywords

condensationstrong connectivitybidirected graph

Mathematics Subject Classification ID

Connectivity (05C40)

Cites Work

• Edge-connectivity augmentation problems
• Orientation of signed graphs
• Block triangularization of skew-symmetric matrices
• Increasing digraph arc-connectivity by arc addition, reversal and complement
• On structures of bisubmodular polyhedra
• Maximum skew-symmetric flows and matchings
• Decomposition of a bidirected graph into strongly connected components and its signed poset structure
• Path problems in skew-symmetric graphs
• On the notion of balance of a signed graph
• Acyclic Bidirected and Skew-Symmetric Graphs: Algorithms and Structure
• Augmenting Graphs to Meet Edge-Connectivity Requirements
• Augmentation Problems
• Making Bipartite Graphs DM-Irreducible
• Reducibility among Combinatorial Problems
• Antisymmetrical Digraphs
• Maximum skew-symmetric flows

This page was built for publication: Making bidirected graphs strongly connected