Advances in Decision Sciences
Volume 2005 (2005), Issue 2, Pages 107-111
doi:10.1155/JAMDS.2005.107

Minmax strongly connected subgraphs with node penalties

Abstract

We propose an O(min{m+n log n,m log∗n}) to find a minmax strongly connected spanning subgraph of a digraph with n nodes and m arcs. A generalization of this problem called the minmax strongly connected subgraph problem with node penalties is also considered. An O(m log n) algorithm is proposed to solve this general problem. We also discuss ways to improve the average complexity of this algorithm.