Strongly connected spanning subgraphs with the minimum number of arcs in semicomplete multipartite digraphs

@inproceedings{BangJensen1999StronglyCS,
  title={Strongly connected spanning subgraphs with the minimum number of arcs in semicomplete multipartite digraphs},
  author={J{\o}rgen Bang-Jensen and Anders Yeo},
  year={1999}
}
We consider the problem (MSSS) of finding the minimum number of arcs in a spanning strongly connected subgraph of a strongly connected digraph. This problem is NP-hard for general digraphs since it generalizes the hamiltonian cycle problem. We characterize the number of arcs in a minimum spanning strong subgraph for digraphs which are either extended semicomplete or semicomplete bipartite. Our proofs lead to polynomial algorithms for finding an optimal subgraph for every digraph from each of… CONTINUE READING

Citations

Publications citing this paper.

Similar Papers

Loading similar papers…