• Journal of applied mathematics & informatics
• /
• v.27 no.3_4
• /
• pp.809-817
• /
• 2009

We call a cycle C be a small cycle if the length of C equals to 3 or 4. In this paper, we obtain two sufficient conditions to ensure the existence of vertex-disjoint small cycles in graph and propose several problems.

• Proceedings of the KAIS Fall Conference
• /
• 2010.05b
• /
• pp.1189-1192
• /
• 2010

컴퓨터 과학 교육 분야의 알고리즘을 학습할 수 있는 교육용 콘텐츠를 제안한다. 제안하는 콘텐츠는 컴퓨터 과학 교육을 학습 하고자 할 때에 학습 효과를 더욱 증대시키기 위한 것 이다. 본 논문은 그래프 알고리즘을 기반으로 하는 학습 콘텐츠 플래시를 만들고자 한다. 학습 콘텐츠의 기반은 플래시 형식으로 하고, 학습자가 스스로 학습할 수 있는 콘텐츠를 플래시 기반으로 하여 설계하여 동적으로 학습 하도록 구현하였다.

• Genomics & Informatics
• /
• v.3 no.2
• /
• pp.47-51
• /
• 2005

Molecular mechanisms of biological processes are typically represented as 'pathways' that have a graph­analogical network structure. However, due to the diversity of topics that pathways cover, their constituent biological entities are highly diverse and the semantics is embedded implicitly. The kinds of interactions that connect biological entities are likewise diverse. Consequently, how to model or process pathway data is not a trivial issue. In this review article, we give an overview of the challenges in pathway database development by taking the INOH project as an example.

• Journal of applied mathematics & informatics
• /
• v.23 no.1_2
• /
• pp.193-203
• /
• 2007

In this paper we consider the inverse minimum flow (ImF) problem, where lower and upper bounds for the flow must be changed as little as possible so that a given feasible flow becomes a minimum flow. A linear time and space method to decide if the problem has solution is presented. Strongly and weakly polynomial algorithms for solving the ImF problem are proposed. Some particular cases are studied and a numerical example is given.

• ETRI Journal
• /
• v.31 no.2
• /
• pp.240-242
• /
• 2009

A computationally efficient implementation of the progressive edge-growth algorithm is presented. This implementation uses an array of red-black (RB) trees to manage the layered structure of check nodes and adopts a new strategy to expand the Tanner graph. The complexity analysis and the simulation results show that the proposed approach reduces the computational effort effectively. In constructing a low-density parity check code with a length of $10^4$, the RB-tree-array-based implementation takes no more 10% of the time required by the original method.

• Journal of applied mathematics & informatics
• /
• v.39 no.3_4
• /
• pp.339-358
• /
• 2021

Zagreb indices and their modified versions of a molecular graph are important descriptors which can be used to characterize the structural properties of organic molecules from different aspects. In this work, we investigate some properties of the modified second multiplicative Zagreb index of graphs with given connectivity. In particular, we obtain the maximum values of the modified second multiplicative Zagreb index with fixed number of cut edges, or cut vertices, or edge connectivity, or vertex connectivity of graphs. Furthermore, we characterize the corresponding extremal graphs.

• Journal of Information Processing Systems
• /
• v.16 no.6
• /
• pp.1231-1237
• /
• 2020

In recent years, future information and communication technology (ICT) has influenced and changed our lives. Without various ICT-based applications, we would have difficulty in securely storing, efficiently processing, and conveniently communicating information. In the future, ICT will play a very important role in the convergence of computing, communication, and all other computational sciences and application. ICT will also influence various fields including communication, science, engineering, industry, business, law, politics, culture, and medicine. In this paper, we investigate the latest algorithms, processes, and services in future fields.

• Proceedings of the Korea Database Society Conference
• /
• 1999.06a
• /
• pp.353-359
• /
• 1999

We present a matrix-based inference algorithm suitable for electronic commerce applications. For this purpose, an Extended AND-OR Graph (EAOG) was developed with the intention that fast inference process is enabled within the electronic commerce situations. The proposed EAOG inference mechanism has the following three characteristics. 1. Real-time inference: The EAOG inference mechanism is suitable for the real-time inference because its computational mechanism is based on matrix computation. 2. Matrix operation: All the subjective knowledge is delineated in a matrix form. so that inference process can proceed based on the matrix operation which is computationally efficient. 3. Bi-directional inference: Traditional inference method of expert systems is based on either forward chaining or backward chaining which is mutually exclusive in terms of logical process and computational efficiency. However, the proposed EAOG inference mechanism is generically bi-directional without loss of both speed and efficiency. We have proved the validity of our approach with several propositions and an illustrative EC example.

• Proceedings of the Korean Society of Computational and Applied Mathematics Conference
• /
• 2003.09a
• /
• pp.16.1-16
• /
• 2003

A subset S of vertices of a graph G is independent if no two vertices of S are adjacent by an edge in G. Also we say that S is maximal independent if it is contained In no larger independent set in G. A planted plane tree is a tree that is embedded in the plane and rooted at an end-vertex. A (k＋1) -valent tree is a planted plane tree in which each vertex has degree one or (k＋1). We classify maximal independent sets of (k＋1) -valent trees into two groups, namely, type A and type B maximal independent sets and consider specific independent sets of these trees. We study relations among these three types of independent sets. Using the relations, we count the number of all maximal independent sets of (k＋1) -valent trees with n vertices of degree (k＋1).

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 1999.03a
• /
• pp.353-359
• /
• 1999

We present a matrix-based inference alorithm suitable for electronic commerce applications. For this purpose, an Extended AND-OR Graph (EAOG) was developed with the intention that fast inference process is enabled within the electronic commerce situations. The proposed EAOG inference mechanism has the following three characteristics. 1. Real-time inference: The EAOG inference mechanism is suitable for the real-time inference because its computational mechanism is based on matric computation.2. Matrix operation: All the subjective knowledge is delineated in a matrix form, so that inference process can proceed based on the matrix operation which is computationally efficient.3. Bi-directional inference: Traditional inference method of expert systems is based on either forward chaining or backward chaining which is mutually exclusive in terms of logical process and exclusive in terms of logical process and computational efficiency. However, the proposed EAOG inference mechanism is generically bi-directional without loss of both speed and efficiency. We have proved the validity of our approach with several propositions and an illustrative EC example.