• Proceedings of the Korea Database Society Conference
• /
• 2008.05a
• /
• pp.211-224
• /
• 2008

As a lot of information and media are given to users in Internet space nowadays, users feel disoriented or "lost in space" intensively. So it is suggested that we have the system to reduce information overload and to propose effective and efficient information. In this study we present a visualizing technique which uses fisheye views on data adjacency to combine global context and local details for presentation of many results in limited space. Data Adjacency on graph theory is applied to set up degree of interest which is main focus in fisheye views. Graph theory is useful to solve the problem resulted from various combinational optimization, especially it has advantages to analyze issues in information space like Internet. To test the usability of the proposed visualization technique, we compared the effectiveness of different visualization techniques. Results show that our method is evaluated with respect to less time and high satisfaction for a task accomplishment.

• Communications of the Korean Mathematical Society
• /
• v.11 no.4
• /
• pp.1137-1145
• /
• 1996

A Steinhaus graph is a labelled graph whose adjacency matrix $A = (a_{i,j})$ has the Steinhaus property : $a_{i,j} + a{i,j+1} \equiv a_{i+1,j+1} (mod 2)$. We consider random Steinhaus graphs with n labelled vertices in which edges are chosen independently and with probability $\frac{1}{2}$. We prove that almost all Steinhaus graphs are Hamiltonian like as in random graph theory.

• Kyungpook Mathematical Journal
• /
• v.64 no.1
• /
• pp.171-184
• /
• 2024

In this paper, we show that if G is strongly regular then the Gallai graph Γ(G) and the anti-Gallai graph ∆(G) of G are edge-regular. We also identify conditions under which the Gallai and anti-Gallai graphs are themselves strongly regular, as well as conditions under which they are 2-connected. We include also a number of concrete examples and a discussion of spectral properties of the Gallai and anti-Gallai graphs.

• The Journal of Korea Robotics Society
• /
• v.8 no.2
• /
• pp.82-91
• /
• 2013

This paper proposes a building recognition algorithm using watershed image segmentation algorithm and integrated region matching (IRM). To recognize a building, a preprocessing algorithm which is using Gaussian filter to remove noise and using canny edge extraction algorithm to extract edges is applied to input building image. First, images are segmented by watershed algorithm. Next, a region adjacency graph (RAG) based on the information of segmented regions is created. And then similar and small regions are merged. Second, a color distribution feature of each region is extracted. Finally, similar building images are obtained and ranked. The building recognition algorithm was evaluated by experiment. It is verified that the result from the proposed method is superior to color histogram matching based results.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.12
• /
• pp.101-106
• /
• 2015

This paper suggests heuristic algorithm with polynomial time complexity for rigging elections problem that can be obtain the optimal solution using linear programming. The proposed algorithm transforms the given problem into adjacency graph. Then, we divide vertices V into two set W and D. The set W contains majority distinct and the set D contains minority area. This algorithm applies divide-and-conquer method that the minority area D is include into majority distinct W. While this algorithm using simple rule, that can be obtains the optimal solution equal to linear programing for experimental data. This paper shows polynomial time solution finding rule potential in rigging elections problem.

• Journal of the Korean Data and Information Science Society
• /
• v.22 no.1
• /
• pp.19-27
• /
• 2011

Recommendation systems are developed to overcome the problems of selection and to promote intention to use. In this study, we propose a recommendation system using adjacency data according to user's behavior over time. For this, the product adjacencies are identified from the adjacency matrix based on graph theory. This research finds that there is a trend in the users' behavior over time though product adjacency fluctuates over time. The system is tested on its usability. The tests show that implementing this recommendation system increases users' intention to purchase and reduces the search time.

• East Asian mathematical journal
• /
• v.16 no.1
• /
• pp.147-159
• /
• 2000

In this paper, we investigate the properties of non-normal(convexoid, hyponormal) adjacency operators for a graph under two operations, tensor product and Cartesian one.

• Journal of applied mathematics & informatics
• /
• v.42 no.4
• /
• pp.725-737
• /
• 2024

This article introduces the concepts of Energy and Laplacian Energy (LE) of Domination in Hesitancy fuzzy graph (DHFG). Also, the adjacency matrix of a DHFG is defined and proposed the definition of the energy of domination in hesitancy fuzzy graph, and Laplacian energy of domination in hesitancy fuzzy graph is given.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.1
• /
• pp.143-152
• /
• 2013

Given weighted graph G=(V,E), n=|V|, m=|E|, the minimum cut problem is classified with source s and sink t or without s and t. Given undirected weighted graph without s and t, Stoer-Wagner algorithm is most popular. This algorithm fixes arbitrary vertex, and arranges maximum adjacency (MA)-ordering. In the last, the sum of weights of the incident edges for last ordered vertex is computed by cut value, and the last 2 vertices are merged. Therefore, this algorithm runs $\frac{n(n-1)}{2}$ times. Given graph with s and t, Ford-Fulkerson algorithm determines the bottleneck edges in the arbitrary augmenting path from s to t. If the augmenting path is no more exist, we determine the minimum cut value by combine the all of the bottleneck edges. This paper suggests minimum cut algorithm for undirected weighted graph with s and t. This algorithm suggests MA-merging and computes cut value simultaneously. This algorithm runs n-1 times and successfully divides V into disjoint S and V sets on the basis of minimum cut, but the Stoer-Wagner is fails sometimes. The proposed algorithm runs more than Ford-Fulkerson algorithm, but finds the minimum cut value within n-1 processing times.

• Bulletin of the Korean Mathematical Society
• /
• v.41 no.1
• /
• pp.125-135
• /
• 2004

One of the intriguing and fundamental algorithmic graph problems is the computation of the strongly connected components of a directed graph G. In this paper we first introduce a simple procedure for determining the location of the nonzero elements occurring in $B^{-1}$ without fully inverting B, where EB\;{\equiv}\;(b_{ij)\;and\;B^T$ are diagonally dominant matrices with $b_{ii}\;>\;0$ for all i and $b_{ij}\;{\leq}\;0$, for $i\;{\neq}\;j$, and then, as an application, show that all of the strongly connected components of a directed graph G can be recognized by the location of the nonzero elements occurring in the matrix $C(G)\;=\;(D\;-\;A(G))^{-1}$. Here A(G) is an adjacency matrix of G and D is an arbitrary scalar matrix such that (D - A(G)) becomes a diagonally dominant matrix.