Journal of Applied Mathematics and Decision Sciences 
Volume 2005 (2005), Issue 2, Pages 107-111
doi:10.1155/JAMDS.2005.107

Minmax strongly connected subgraphs with node penalties

Abraham P. Punnen

 Department of Mathematics, Simon Fraser University, 13450 102 Avenue Surrey, V3T 5X3, BC, Canada
Received 10 October 2002; Revised 25 July 2003

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.