• Journal of the Korean Statistical Society
• /
• v.29 no.3
• /
• pp.297-306
• /
• 2000

An efficient method of constructing $textsc{k}$-minimal path sets to evaluate the reliability of a flow network is presented. The network is considered to be in a functioning state if it can transmit a maximum flow which is greater than or equal to a specified amount of flow, $textsc{k}$say, and a $textsc{k}$-minimal path set is a minimal set of branches that satisfies the given flow constraint. In this paper, under the assumption that minimal path sets of the network are known, we generate composite paths by adding only a minimal set of branches at each iteration to get $textsc{k}$-minimal path sets after possibly the fewest composition, and compute maximum flow of composite paths using only minimal path sets. Thereby we greatly reduce the possible occurrence of redundant composite paths throughout the process and efficiently compute the maximum flow of composite paths generated. Numerical examples illustrate the method.

• Journal of Korea Society of Industrial Information Systems
• /
• v.8 no.3
• /
• pp.91-98
• /
• 2003

Visitors who browse the web from wireless PDAs, cell phones are frequently frustrated by interfaces. Simply replacing graphics with text and reformatting tables does not solve this problem, because deep link structures can still require more time. To solve this problem, in the paper we propose an algorithm, Minimal Path Algorithm that automatically improves wireless web navigation by suggesting useful shortcut links in real time. In the result of this paper, Minimal Path algorithm offer the shortcut and the number of shortest links to web users.

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.9
• /
• pp.789-794
• /
• 2005

This paper describes an algorithm for minimal turning complete coverage Path planning for cleaning robots. This algorithm divides the whole cleaning area by cellular decomposition, and then provides the path planning among the cells employing a flow network. It also provides specific path planning inside each cell guaranteeing the minimal turning of the robots. The minimal turning of the robots is directly related to the faster motion and energy saving. The proposed algorithm is compared with previous approaches in simulation and the result shows the validity of the algorithm.

• Proceedings of the Korean Statistical Society Conference
• /
• 2002.11a
• /
• pp.119-124
• /
• 2002

We consider a multi-state flow network consisted of undirected links and focus on how to find efficiently the union of minimal paths transmitting a required flow when minimal paths are known.

• The Journal of Korea Robotics Society
• /
• v.6 no.3
• /
• pp.255-262
• /
• 2011

Many intelligent robots have to be given environmental information to perform tasks. In this paper an intelligent robot, that is, a cleaning robot used a sensor fusing method of two sensors: LRF and StarGazer, and then was able to obtain the information. Throughout wall following using laser displacement sensor, LRF, the working area is built during the robot turn one cycle around the area. After the process of wall following, a path planning which is able to execute the work effectively is established using flow network algorithm. This paper describes an algorithm for minimal turning complete coverage path planning for intelligent robots. This algorithm divides the whole working area by cellular decomposition, and then provides the path planning among the cells employing flow networks. It also provides specific path planning inside each cell guaranteeing the minimal turning of the robots. The proposed algorithm is applied to two different working areas, and verified that it is an optimal path planning method.

• Journal of Information Processing Systems
• /
• v.13 no.1
• /
• pp.104-113
• /
• 2017

In this paper, we present an approach to transmit data from the source to the destination through a minimal path (least-cost path) in a computer network of n nodes. The motivation behind our approach is to address the problem of finding a minimal path between the source and destination. From the work we have studied, we found that a Steiner tree with bounded Steiner vertices offers a good solution. A novel algorithm to construct a Steiner tree with vertices and bounded Steiner vertices is proposed in this paper. The algorithm finds a path from each source to each destination at a minimum cost and minimum number of Steiner vertices. We propose both the sequential and parallel versions. We also conducted a comparative study of sequential and parallel versions based on time complexity, which proved that parallel implementation is more efficient than sequential.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.1
• /
• pp.11-20
• /
• 1995

A new graph problem is formulated to limit the maximum path length of a general directed graph when a minimal set of vertices together with their incident edges are removed from the graph. An optimal algorithm and a heuristic algorithm are proposed and the proposed heuristic algorithm is shown to be effective through experiments using a collection of graphs obtained from large sequential circuits. The heuristic algorithm is based on a feedback vertex set algorithm based on graph reduction.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2002.06a
• /
• pp.223-228
• /
• 2002

본 논문에서는 최근 이동 컴퓨팅의 확산과 더불어 이에 부합하기 위한 웹이나 분산환경과 같은 새로운 소프트웨어 아키텍처를 기반으로 하는 애플리케이션이 개발되고 있으며, 이동중 통신을 필요로 하는 사용자가 늘어나고 있는 추세이다. 이에 본 논문에서는 이동 컴퓨터 환경에서 이용자에게 가장 적합한 웹 사이트를 제공하기 위하여 Minimal Path 알고리즘을 이용한 항해 설계를 하였다. 연구결과는 향후 이동전자상거래 시스템 구축시 다양한 응용 서비스의 향상에 이용될 것이다.

• Journal of Korean Society for Quality Management
• /
• v.28 no.1
• /
• pp.105-118
• /
• 2000

In this paper, we consider an interconnection network, DRDT (Dual Receive Dual Transmit), that is a double-loop ring topology and adopts the concept of multiple packets transmission. For three types of DRDT configurations, we investigate some properties related to path sets and discuss the method for finding minimal path sets. Using the concept of the terminal reliability and the path sets approach, we evaluate the reliability of the DRDT networks and compare them with a single ring network and a unidirectional double-loop ring network.

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1463-1466
• /
• 1987

The problem of generating minimal area CMOS functional cell layout can be converted to that of decomposing the transistor connection graph into a minimum number of subgraphs, each having a pair of Euler paths with the same sequence of input labels on the N-graph and P-graph, which are portions of the graph corresponding to NMOS and PMOS parts respectively. This paper proposes a heuristic algorithm which yields a nearly minimal number of Euler paths from the path representation formula which represents the give a logic function. Subpath merging is done through a list processing scheme where the pair of paths which results in the lowest cost is successively merged from all candidate merge pairs until no further path merging and further reduction of number of subgraphs are possible. Two examples were shown where we were able to further reduce the number of interlaces, i.e., the number of non-butting diffusion islands, from 3 to 2, and from 2 to 1, compared to the earlier work [1].