Making Bidirected Graphs Strongly Connected [article]

Tatsuya Matsuoka, Shun Sato
2017 arXiv   pre-print
We consider problems to make a given bidirected graph strongly connected with minimum cardinality of additional signs or additional arcs. For the former problem, we show the minimum number of additional signs and give a linear-time algorithm for finding an optimal solution. For the latter problem, we give a linear-time algorithm for finding a feasible solution whose size is equal to the obvious lower bound or more than that by one.
arXiv:1709.00824v1 fatcat:fwtxgtmopje3fhsa4ahmvtf36u