• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10a
• /
• pp.178-180
• /
• 2003

최소 걸침 나무는 널리 알려진 순회 판매원 문제와 같이 전통적인 최적화 문제 중에 하나이다. 특히나 최소 걸침 나무와는 달리 차수 제약 최소 걸침 나무의 경우는 일반적으로 NP-hard 문제로 알려져 있다. 이러한 NP-hard 문제를 해결하기 위한 다양한 접근법들이 소개되었는데 유전 알고리즘은 효율적인 방법 중에 하나로 알려져 있다. 유전 알고리즘과 같이 진화에 기반을 둔 알고리즘을 어떤 문제에 적응하기 위해서 가장 우선적으로 고려되어야 하는 것은 해를 어떻게 표현할 것인가 인데 본 논문에서는 차수 제약 최소 걸침 나무를 해결하기 위한 새로운 트리 표현법을 제안한다.

• Journal of Korean Society of Coastal and Ocean Engineers
• /
• v.30 no.2
• /
• pp.61-68
• /
• 2018

This study was conducted to propose the optimum minimum requirement of cutoff system composed of the impermeable soil layer and vertical barrier in offshore landfill for prevention pollution leakage by seepage, advection, and dispersion numerical analyses under steady state. According to the study results, the minimum requirement of impermeable soil layer is below $1{\times}10^{-6}cm/s$ of hydraulic conductivity with more than 500 cm thickness or a system with equivalent cutoff effect. The minimum requirement of vertical barrier is below $1{\times}10^{-6}cm/s$ of hydraulic conductivity with more than 50 cm thickness or a system with equivalent cutoff effect. In addition, the vertical barrier should be embedded enough to seal securely with the impermeable soil layer for working cutoff effect.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.5
• /
• pp.31-39
• /
• 2015

The degree-constrained minimum spanning tree (d-MST) problem is considered NP-complete for no exact solution-yielding polynomial algorithm has been proposed to. One thus has to resort to an heuristic approximate algorithm to obtain an optimal solution to this problem. This paper therefore presents a polynomial time algorithm which obtains an intial solution to the d-MST with the help of Kruskal's algorithm and performs k-opt on the initial solution obtained so as to derive the final optimal solution. When tested on 4 graphs, the algorithm has successfully obtained the optimal solutions.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.11
• /
• pp.159-165
• /
• 2013

This paper proposes a O(E) polynomial-time algorithm that has been devised to simultaneously solve edge-coloring problem and graph classification problem both of which remain NP-complete. The proposed algorithm selects an edge connecting maximum and minimum degree vertices so as to determine the number of edge coloring ${\chi}^{\prime}(G)$. Determined ${\chi}^{\prime}(G)$ is in turn either ${\Delta}(G)$ or ${\Delta}(G)+1$. Eventually, the result could be classified as class 1 if ${\chi}^{\prime}(G)={\Delta}(G)$ and as category 2 if ${\chi}^{\prime}(G)={\Delta}(G)+1$. This paper also proves Vizing's planar graph conjecture, which states that 'all simple, planar graphs with maximum degree six or seven are of class one, closing the remaining possible case', which has known to be NP-complete.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.5
• /
• pp.1-6
• /
• 2022

This paper deals with the maximum cardinality matching(MCM) problem. The augmenting path technique is well known in MCM. MCM is obtained by $O({\sqrt{n}}m)$ time complexity augmenting path algorithm for the general graph, and O(m log n) algorithm for the bipartite graph. On the other hand, this paper suggests O(n) linear time algorithm. The proposed algorithm based on the basic principle of as possible as largest selected inter-vertex edges in order to obtain the MCM. This paper simply selects edge {u,𝜐} that the minimum degree vertex u and minimum degree vertex 𝜐 in N_G(u) 𝜈(G)=k times iteration. For various general and bipartite graphs experimental data, this algorithm can be get the 𝜈(G) exactly.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.9
• /
• pp.121-129
• /
• 2013

This paper proposes a linear-time algorithm that has been designed to obtain an accurate solution for Dominating Set (DS) problem, which is known to be NP-complete due to the deficiency of polynomial-time algorithms that successfully derive an accurate solution to it. The proposed algorithm does so by repeatedly assigning vertex v with maximum degree ${\Delta}(G)$among vertices adjacent to the vertex v with minimum degree ${\delta}(G)$ to Minimum Independent DS (MIDS) as its element and removing all the incident edges until no edges remain in the graph. This algorithm finally transforms MIDS into Minimum DS (MDS) and again into Minimum Connected DS (MCDS) so as to obtain the accurate solution to all DS-related problems. When applied to ten different graphs, it has successfully obtained accurate solutions with linear time complexity O(n). It has therefore proven that Dominating Set problem is rather a P-problem.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.3
• /
• pp.193-199
• /
• 2019

In this paper I propose an algorithm of linear time complexity for NP-complete Maximum Independent Set (MIS) problem. Based on the basic property of the MIS, which forbids mutually adjoining vertices, the proposed algorithm derives the solution by repeatedly selecting vertices in the ascending order of their degree, given that the degree remains constant when vertices ${\nu}$ of the minimum degree ${\delta}(G)$ are selected and incidental edges deleted in a graph of n vertices. When applied to 22 graphs, the proposed algorithm could obtain the MIS visually yet effortlessly. The proposed linear MIS algorithm of time complexity O(n) always executes ${\alpha}(G)$ times, the cardinality of the MIS, and thus could be applied as a general algorithm to the MIS problem.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.6 no.4
• /
• pp.43-52
• /
• 1986

With increasing of computer use, a least squares method is now widely used in the regression analysis of various data. Unreliable results of regression coefficients due to the floating point of computer and problems of ordinary least squares method are described in detail. To improve these problems, a least squares method using orthogonal function is developed. Also, Comparison and analysis are performed through an example of numerical test, and re-orthogonalization method is used to increase the accuracy. As an example of application, the optimum order of AR process for the time series of monthly flow at the Pyungchang station is determined using Akaike's FPE(Final Prediction Error) which decides optimum degree of AR process. The result shows the AR(2) process is optimum to the series at the station.

• Proceedings of the Korean Environmental Sciences Society Conference
• /
• 2004.11a
• /
• pp.50-53
• /
• 2004

하천 분기특성을 이용한 유출해석모형에서 최소하천의 크기는 매우 민감한 영향을 미치게 되므로 본 연구에서는 금호강 중류의 금호수위표지점 상류 유역을 대상으로 하여 DEM 격자크기와 최소차 하천의 임계면적에 따른 지형매개변수의 변화특성을 검토하였다. 분석에서는 유역내의 1:25,000 수치지형도를 $10\times10,\;30\times30,\;50\times50m$ 격자망으로 구성하여 하천차수별 개수, 유로연장, 면적, 만곡도, 배수밀도 및 유로연장 등을 대상으로 하였다.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.52-52
• /
• 2000