Making Bidirected Graphs Strongly Connected

09/04/2017
by   Tatsuya Matsuoka, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset