Making Bidirected Graphs Strongly Connected
Discrete Mathematics
2017-09-05 v1
Abstract
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.
Keywords
Cite
@article{arxiv.1709.00824,
title = {Making Bidirected Graphs Strongly Connected},
author = {Tatsuya Matsuoka and Shun Sato},
journal= {arXiv preprint arXiv:1709.00824},
year = {2017}
}
Comments
14pages