• Journal of the Architectural Institute of Korea Planning & Design
• /
• v.35 no.12
• /
• pp.21-29
• /
• 2019

The purpose of the study is to be the pedestrian integrated circulation system of malling route and the third route in Mixed-use Building based on User Behavior. The study has performed by the following approaches: Initially, literature reviews are performed related to a pedestrian route by user in mixed-use building. Second, general and stroller users moving route are analyzed based on the outcome of the case study. Finally, the study develops the efficient pedestrian integrated circulation system of malling route and the third route in Mixed-use Building. According to the study, the following conclusions were made: First, An integrated plan for escalators and EVs, which are accessible to both users and strollers, is needed. Second, The entrance automatic door and circulation elements should be connected for continuous move by the stroller users. Finally, The circulation system of complex buildings should be a simple spatial structure and route plan that users can easily recognize.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.1-23
• /
• 2005

The shortest-paths problem is a fundamental problem in graph theory and finds diverse applications in various fields. This is why shortest path algorithms have been designed more thoroughly than any other algorithm in graph theory. A large number of optimization problems are mathematically equivalent to the problem of finding shortest paths in a graph. The shortest-path between a pair of vertices is defined as the path with shortest length between the pair of vertices. The shortest path from one vertex to another often gives the best way to route a message between the vertices. This paper presents an $O(n^2)$ time sequential algorithm and an $O(n^2/p+logn)$ time parallel algorithm on EREW PRAM model for solving all pairs shortest paths problem on circular-arc graphs, where p and n represent respectively the number of processors and the number of vertices of the circular-arc graph.