Advances in Decision Sciences

Advances in Decision Sciences / 2005 / Article
Special Issue

Combinatorial Optimization

View this Special Issue

Open Access

Volume 2005 |Article ID 684573 | https://doi.org/10.1155/JAMDS.2005.107

Abraham P. Punnen, "Minmax strongly connected subgraphs with node penalties", Advances in Decision Sciences, vol. 2005, Article ID 684573, 5 pages, 2005. https://doi.org/10.1155/JAMDS.2005.107

Minmax strongly connected subgraphs with node penalties

Received10 Oct 2002
Revised25 Jul 2003

Abstract

We propose an O(min{m+n log n,m logn}) 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.

Copyright © 2005 Hindawi Publishing Corporation. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


More related articles

 PDF Download Citation Citation
 Order printed copiesOrder
Views127
Downloads254
Citations

We are committed to sharing findings related to COVID-19 as quickly as possible. We will be providing unlimited waivers of publication charges for accepted research articles as well as case reports and case series related to COVID-19. Review articles are excluded from this waiver policy. Sign up here as a reviewer to help fast-track new submissions.