• 대한수학회보
• /
• 제55권5호
• /
• pp.1405-1417
• /
• 2018

The aim of this work is to introduce several different volume computational methods of graph polytopes associated with various types of finite simple graphs. Among them, we obtained the recursive volume formula (RVF) that is fundamental and most useful to compute the volume of the graph polytope for an arbitrary finite simple graph.

• 디지털산업정보학회논문지
• /
• 제17권3호
• /
• pp.27-37
• /
• 2021

Highly informative heuristics in AI planning can help to a more efficient search a solutions. However, in general, to obtain informative heuristics from planning problem specifications requires a lot of computational effort. To address this problem, we propose a Partial Planning Graph(PPG) and Mixed Heuristics for solving planning problems more efficiently. The PPG is an improved graph to be applied to can find a partial heuristic value for each goal condition from the relaxed planning graph which is a means to get heuristics to solve planning problems. Mixed Heuristics using PPG requires size of each graph is relatively small and less computational effort as a partial plan generated for each goal condition compared to the existing planning graph. Mixed Heuristics using PPG can find partial interactions for each goal conditions in an effective way, then consider them in order to estimate the goal state heuristics. Therefore Mixed Heuristics can not only find interactions for each goal conditions more less computational effort, but also have high accuracy of heuristics than the existing max and additive heuristics. In this paper, we present the PPG and the algorithm for computing Mixed Heuristics, and then explain analysis to accuracy and the efficiency of the Mixed Heuristics.

• 한국정보전자통신기술학회논문지
• /
• 제14권4호
• /
• pp.314-322
• /
• 2021

Skeleton-based action recognition has attracted considerable attention in human action recognition. Recent methods for skeleton-based action recognition employ spatiotemporal graph convolutional networks (GCNs) and have remarkable performance. However, most of them have heavy computational complexity for robust action recognition. To solve this problem, we propose a shuffle graph convolutional network (SGCN) which is a lightweight graph convolutional network using pointwise group convolution rather than pointwise convolution to reduce computational cost. Our SGCN is composed of spatial and temporal GCN. The spatial shuffle GCN contains pointwise group convolution and part shuffle module which enhances local and global information between correlated joints. In addition, the temporal shuffle GCN contains depthwise convolution to maintain a large receptive field. Our model achieves comparable performance with lowest computational cost and exceeds the performance of baseline at 0.3% and 1.2% on NTU RGB+D and NTU RGB+D 120 datasets, respectively.

• 컴퓨터교육학회논문지
• /
• 제21권6호
• /
• pp.39-47
• /
• 2018

이 연구는 사다리타기 게임에서 등장하는 사다리 모양에 따른 이산구조를 순열과 조합적 사고, 알고리즘적 구현을 통하여 최소생성사다리를 생성하는 방법과 컴퓨팅 사고력과의 관련성을 탐구하는 내용을 다루었다. 먼저 연구자는 사다리 모양의 세로판과 가로판의 조합에 따라서 생성되는 순열 중에서 역순열에 대응하는 사다리(최소생성사다리)를 필터링 기법과 새로 개선한 알고리즘을 고안하여 Mathematica 프로젝트로 진행하였다. 그 결과 최소생성사다리를 생성원(generator)으로 하는 새로운 그래프를 Mathematica로 창출하여 YC그래프라 이름 붙였으며 그에 대한 속성을 조사하였다. YC그래프는 이전 차원의 그래프를 내포하는 재귀적 구조와 다층 구조를 가졌으며 간선대칭의 특징을 보여주었다. 또한 계산복잡도가 증가함에 따라 세로판 5개, 가로판 10개 사다리부터 층별로 최소생성사다리를 생성하도록 탐색 공간을 분할하는 알고리즘을 적용하였다. 이 과정에서 자료의 시각화, 추상화 및 병렬처리 알고리즘 구현을 통한 컴퓨팅 사고력이 새로운 YC그래프의 창출 및 구조 분석에 기여한 것으로 나타났다.

• Journal of applied mathematics & informatics
• /
• 제27권5_6호
• /
• pp.1307-1318
• /
• 2009

An infinite locally finite plane graph is an LV-graph if it is 3-connected and VAP-free. In this paper, as a preparatory work for solving the problem concerning the existence of a spanning 3-tree in an LV-graph, we investigate the existence of a spanning 3-forest in a bridge of type 0,1 or 2 of a tight semi ring in an LV-graph satisfying certain conditions.

• Journal of applied mathematics & informatics
• /
• 제42권1호
• /
• pp.159-167
• /
• 2024

The Topological indices are known as Mathematical characterization of molecules. In this paper, we have studied line graph of subdivision and semi-total point graph of triangular benzenoid, polynomino chains of 8-cycles and graphene sheet through forgotten and first Zagreb indices.

• Journal of applied mathematics & informatics
• /
• 제33권1_2호
• /
• pp.89-100
• /
• 2015

In this paper, we present exact formulae for the multiplicatively weighted Harary indices of join, tensor product and strong product of graphs in terms of other graph invariants including the Harary index, Zagreb indices and Zagreb coindices. Finally, We apply our result to compute the multiplicatively weighted Harary indices of fan graph, wheel graph and closed fence graph.

• Journal of applied mathematics & informatics
• /
• 제28권3_4호
• /
• pp.893-908
• /
• 2010

In this paper we prove the existence of spanning 3-trees in a 3-connected infinite locally finite VAP-free plane graph. Together with the results of Barnette and the author, this yields that every finite or infinite 3-connected locally finite VAP-free plane graph contains a spanning 3-tree.

• Journal of applied mathematics & informatics
• /
• 제42권4호
• /
• pp.777-783
• /
• 2024

Topoloical index is a numerical quantity which is correlates to properties of chemical compound . In this paper, we define operator graph namely, Edge ss-corona graph and we study structured properties of that graph. Also, establish the upper and lower bounds for First Zagreb index, Second Zagreb index, First Gourava index, SK₁ index, Forgotten topological index and EM₁ index of edge SS-corona graph.

• Journal of applied mathematics & informatics
• /
• 제41권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.