본문 바로가기
  • Home

Linear Time Algorithm for Network Reliability Problem

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2016, 21(5), pp.73-77
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

Sang-Un, Lee 1

1강릉원주대학교

Accredited

ABSTRACT

This paper deals with the network reliability problem that decides the communication line between main two districts while the  districts were destroyed in military communication network that the  communication lines are connected in  districts. For this problem, there is only in used the mathematical approach as linear programming (LP) software package and has been unknown the polynomial time algorithm. In this paper we suggest the heuristic algorithm with   linear time complexity to solve the optimal solution for this problem. This paper suggests the flow path algorithm (FPA) and level path algorithm (LPA). The FPA is to search the maximum number of distinct paths between two districts. The LPA is to construct the levels and delete the unnecessary nodes and edges. The proposed algorithm can be get the same optimal solution as LP for experimental data.

Citation status

* References for papers published after 2023 are currently being built.