• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.5
• /
• pp.1110-1115
• /
• 2014

The matrix-star and the transposition graphs are considered as star graph variants that have various merits in graph theory such as node symmetry, fault tolerance, recursive scalability, etc. This paper describes an one-to-one mapping algorithm from a matrix-star graph to a transposition graph using adjacent properties in graph theory. The result show that a matrix-star graph $MS_{2,n}$ can be embedded in a transposition graph $T_{2n}$ with dilation n or less and average dilation 2 or less.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.4
• /
• pp.863-868
• /
• 2013

In recently years, many digital logic systems based on graph theory are analyzed and synthesized. This paper presented a method of constructing the function using edge valued extension graph which is based on graph theory. The graph is applied to a new data structure. from binary graph which is recently used in constructing the digital logic systems based on the graph theory. We discuss the mathematical background of literal and reed-muller expansion, and we discuss the edge valued extension graph which is the key of this paper. Also, we propose the algorithms which is the function derivation based on the proposed edge valued extension graph. That is the function minimization method of the n-variables m-valued functions and showed that the algorithm had the regularity with module by which the same blocks were made concerning about the schematic property of the proposed algorithm.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1995.10a
• /
• pp.864-867
• /
• 1995

Presented in the paper is a structured approach to modeling automated manufacturing system (AMS) in the form of an event graph. The proposed two-phase procedure for formal modeling is 1) reference modeling by schematic supervisory control modeling and 2) event graph transformation from supervisory control model. Also described is a formal model for a small-sized FMS in the form of an event graph.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.302-305
• /
• 2000

This paper proposed an optimal register resource allocation algorithm using graph coloring for minimal register at high level synthesis. The proposed algorithm constructed interference graph consist of the intermediated representation CFG to description VHDL. and at interference graph fur the minimal select color selected a position node at stack, the next inserted spill code and the graph coloring process executes for optimal register allocation. The proposed algorithm proves to effect that result compare another allocation techniques through experiments of bench mark.

• International Journal of CAD/CAM
• /
• v.6 no.1
• /
• pp.99-104
• /
• 2006

Engineering graph plays an important role in design and manufacture, such as architecture, machinery, manufacture, military. However, almost no persons consider the security and copyright of two-dimensional engineering graph. A novel method for two-dimensional engineering graph watermark based U system is proposed in this paper. Watermarks generated by this technique can be successfully extracted even after rotation, translation and scaling transform.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.40 no.5
• /
• pp.429-437
• /
• 2022

Recently, the demand for a QA (Question Answering) system for human-machine communication has increased. Among the QA systems, a closed domain QA system that can handle spatial-related questions is called GeoQA. In this study, a new type of graph database, LPG (Labeled Property Graph) was used to overcome the limitations of the RDF (Resource Description Framework) based database, which was mainly used in the GeoQA field. In addition, GraphQL (Graph Query Language), an API-type query language, is introduced to address the fact that the LPG query language is not standardized and the GeoQA system may depend on specific products. In this study, database was built so that answers could be retrieved when spatial-related questions were entered. Each data was obtained from the national spatial information portal and local data open service. The spatial relationships between each spatial objects were calculated in advance and stored in edge form. The user's questions were first converted to GraphQL through FOL (First Order Logic) format and delivered to the database through the GraphQL server. The LPG used in the experiment is Neo4j, the graph database that currently has the highest market share, and some of the built-in functions and QGIS were used for spatial calculations. As a result of building the system, it was confirmed that the user's question could be transformed, processed through the Apollo GraphQL server, and an appropriate answer could be obtained from the database.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.7
• /
• pp.1327-1334
• /
• 2017

The Bubble sort graph is node symmetric, and can be used in the data sorting algorithm. In this research we propose and analyze that Half Bubble sort graph that improved the network cost of Bubble sort graph. The Half Bubble sort graph's number of node is n!, and its degree is ${\lfloor}n/2{\rfloor}+1$. The Half Bubble sort graph's degree is $${\sim_=}0.5$$ times of the Bubble sort, and diameter is $${\sim_=}0.9$$ times of the Bubble sort. The network cost of the Bubble sort graph is $${\sim_=}0.5n^3$$, and the network cost of the half Bubble sort graph is $${\sim_=}0.2n^3$$. We have proved that half bubble sort graph is a sub graph of the bubble sort graph. In addition, we proposed a routing algorithm and analyzed the diameter. Finally, network cost is compared with the bubble sort graph.

• Journal of applied mathematics & informatics
• /
• v.41 no.2
• /
• pp.287-293
• /
• 2023

In this paper, the Augmented graph Es(τ) of the inverse graph Gs(τ) of a cyclic group (τ,◦) was studied. The Augmented inverse graph was constructed by applying the method of Mycielski's construction. The dimension of Augmented inverse graph and different properties of the graph were investigated. Later the chromatic number of Augmented inverse graph was discussed and the relation between the maximum degree of the graph and the chromatic number was established. In the Mycielski's construction, the properties of the key node 'u' in Es (τ) were established based on cardinality of the cyclic group (τ,◦) and also proved that the Augmented inverse graph Es(τ) was a triangle free graph.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.5
• /
• pp.993-1001
• /
• 2003

A RDB Storage Model based on the Edge-Labeled Graph is suggested for store the XML instance in Relational Databases(RDB). The XML instance being stored is represented by Data Graph based on the Edge-Labeled Graph. Data Path Table, Element, Attribute, and Table Index Table values are extracted. Then Database Schema is defined, and the extracted values are stored using the Mapper. In order to support querry, Repository Model offers the translator translating XQL which is used as query language under XPATH, into SQL. In addition, it creates DBtoXML generator restoring the stored XML instance. As a result, storage relationship between the XML instance and proposed model structure can be expressed in terms of Graph-based Path, and it shows the possibility of easy search of random Element and Attribute information.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.5
• /
• pp.653-660
• /
• 2002

This paper proposes a method for storing graphs and defining graph algorithms based on the well-developed relational database. In this method, graphs are represented in the form of relations. Each vertex and edge of a graph is represented as tuples of the table and saved in a database. We developed a library of graph operations for the storage and management of graphs and the development of graph applications. Furthermore, we defined graph algorithms in terms of relational algebraic operations such as projection, selection, and join. They can be implemented with the database language such as SQL. This database approach provides an efficient methodology to deal with very large-scale graphs and to support the development of graph applications.