• 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.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.4
• /
• pp.59-66
• /
• 2004

We define a SG(String Graph) and an ASG(Alive String Graph) to the purpose to do static analysis. For a life and death judgment, we apply the rule to the situation which the stone is included and not included. We define the rules that are SR(String Reduction), ER(Empty Reduction), ET(Edge Transform), and CG(Circular Graph), when the stone is not included. We define the rules that are DESR(Dead Enemy Strings Reduction) and SCSR(Same Color String Reduction), when the stone is included. We evaluate a SG that it is an ASG or not by using rules. And we use APC(Articulation Point Check) nile according to number of articulation points lot a life and death judgment. The performance of our method has been tested on the problem set IGS_31_counted form the Computer Go Test Collection. The test set contains 11,191 Points and 1,123 Strings. We obtain 92.5% accuracy of Points and 95.7% accuracy of Strings.

• Design Convergence Study
• /
• v.14 no.4
• /
• pp.133-150
• /
• 2015

In this study, we proposed Interactive Visualization methods that can be analyzed relations between nations in various viewpoints such as period, issue using total 5211 of the UN General Assembly voting data.For this research, we devised a similarity matrix between nations and developed two visualization method based similarity matrix. The first one is Network Graph Visualization that can be showed relations between nations which participated in the vote of the UN General Assembly like Social Network Graph by year. and the second one is Proximity based Circular Visualization that can be analyzed relations between nations focus on one nation or Changes in voting patterns between nations according to time. This study have a great signification. that's because we proposed Proximity based Circular Visualization methods which merged Line and Circle Graph for network analysis that never tried from other cases of studies that utilize conventional voting data and made it. We also derived co-operatives of each visualization through conducting a comparative experiment for the two visualization. As a research result, we found that Proximity based Circular Visualization can be better analysis each node and Network Graph Visualization can be better analysis patterns for the nations.

• Journal of applied mathematics & informatics
• /
• v.20 no.1_2
• /
• pp.149-156
• /
• 2006

The circular list coloring is a circular version of list colorings of graphs. Let $\chi_{c,l}$ denote the circular choosability(or the circular list chromatic number). In this paper, the circular choosability of outer planar graphs and odd wheel is discussed.

• Kyungpook Mathematical Journal
• /
• v.47 no.2
• /
• pp.165-714
• /
• 2007

The basis number of a graph G is the least positive integer $k$ such that G has a $k$-fold basis. In this paper, we prove that the basis number of the cartesian product of a path with a circular ladder, a M$\ddot{o}$bius ladder and path with a net is exactly 3. This improves the upper bound of the basis number of these graphs for a general theorem on the cartesian product of graphs obtained by Ali and Marougi, see [2]. Also, by this general result, the cartesian product of a theta graph with a M$\ddot{o}$bius ladder is at most 5. But in section 3 we prove that it is at most 4.

• Journal of KIISE:Software and Applications
• /
• v.31 no.10
• /
• pp.1266-1275
• /
• 2004

Bioinformatics is concerned with the creation and development of advanced information and computational technologies for problems in biology. It is divided into genomics, proteomics and metabolimics. In metabolimics, an organism is represented by metabolic pathway, i.e., well-displayed graph, and so the graph drawing tool to draw pathway well is necessary to understand it comprehensively. In this paper, we design an improved drawing algorithm. It enhances the readability by making use of the bipartite graph. Also it is possible to draw large graph properly by considering the facts that metabolic pathway graph is scale-free network and is composed of circular components, hierarchic components and linear components.

• Journal of Advanced Marine Engineering and Technology
• /
• v.29 no.1
• /
• pp.25-33
• /
• 2005

When a circular tube with uniform heat generation within the wall was placed in a cross flow, heat flows by conduction in the circumferential direction due to the asymmetric nature of the fluid flow around the perimeter of the circular tube The circumferential heat flow affects the wall temperature distribution to such an extent that. in some cases, significantly different results may be obtained for geometrically similar surfaces. In the present investigation, the effect of circumferential wall heat conduction is investigated for forced convection around circular tube in cross flow of air and water Two-dimensional temperature distribution $T_w(r,{\theta})$ is calculated through the numerical analysis. The difference between one-dimensional and two-dimensional solutions is demonstrated on the graph of local heat transfer coefficients. It is observed that the effect of working fluid is very remarkable.

• Bulletin of the Korean Mathematical Society
• /
• v.44 no.4
• /
• pp.709-719
• /
• 2007

In [8], it is shown that the complete multipartite graph $K_{n(2t)}$ having n partite sets of size 2t, where $n{\geq}6\;and\;t{\geq}1$, has a decomposition into gregarious 6-cycles if $n{\equiv}0,1,3$ or 4 (mod 6). Here, a cycle is called gregarious if it has at most one vertex from any particular partite set. In this paper, when $n{\equiv}0$ or 3 (mod 6), another method using difference set is presented. Furthermore, when $n{\equiv}0$ (mod 6), the decomposition obtained in this paper is ${\infty}-circular$, in the sense that it is invariant under the mapping which keeps the partite set which is indexed by ${\infty}$ fixed and permutes the remaining partite sets cyclically.

• Advances in Computational Design
• /
• v.1 no.4
• /
• pp.297-313
• /
• 2016

The flexural strength of circular concrete-filled tubes (CCFT) can be estimated by several codes such as ACI, AISC, and Eurocode 4. In AISC and Eurocode, two methods are recommended, which are the strain compatibility method (SCM) and the plastic stress distribution method (PSDM). The SCM of AISC is almost the same as the SCM of the ACI method, while the SCM of Eurocode is similar to the ACI method. Only the assumption of the compressive stress of concrete is different. The PSDM of Eurocode approach is also similar to the PSDM of AISC, but they have different definitions of material strength. The PSDM of AISC is relatively easier to use, because AISC provides closed-form equations for calculating the flexural strength. However, due to the complexity of calculation of circular shapes, it is quite difficult to determine the flexural strength of CCFT following other methods. Furthermore, all these methods give different estimations. In this study, an effort is made to review and compare the codes to identify their differences. The study also develops a computing program for the flexural strength of circular concrete filled tubes under pure bending that is in accordance with the codes. Finally, the developed computing algorithm, which is programmed in MATLAB, is used to generate design aid graphs for various steel grades and a variety of strengths of steel and concrete. These design aid graphs for CCFT beams can be used as a preliminary design tool.

• Korean Journal of Air-Conditioning and Refrigeration Engineering
• /
• v.16 no.6
• /
• pp.546-555
• /
• 2004

With circular tube heated directly or indirectly placed in a cross flow, heat flows circumferentially by conduction due to the asymmetric nature of the fluid flow around the perimeter of the circular tube. The circumferential heat flow affects the wall temperature distribution to such an extent that in some cases. The effects of circumferential wall heat conduction on local convective heat transfer is investigated. The wall heat conduction parameter which can be deduced from the governing energy equation should be used to express the effect of circumferential heat conduction. Two-dimensional temperature distribution is presented through the numerical analysis. The comparison of one-dimensional and two-dimensional solutions is demonstrated on graph of local Nusselt numbers.