• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.11a
• /
• pp.867-870
• /
• 2005

본 논문에서는 피라미드 그래프를 대상으로 링을 임베딩하는 문제를 다룬다. 사이클 확장 연산을 이용하는 사이클의 크기를 확대시켜 나가는 일련의 과정을 통하여 최대 크기의 링을 의미하는 헤밀톤 사이클을 찾을 수 있는 알고리즘을 제시함으로써 임의의 높이 N인 피라미드 그래프 내에 길이 $4^N-1/3$인 링을 임베딩 할 수 있음을 증명한다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.3
• /
• pp.313-323
• /
• 2000

In this paper, we consider ring embedding problem on (n,k)-star graphs. We first present a new ring embedding strategy and also prove the superiority in expandability by showing its application into the fault-tolerant ring embedding problem with edge faults. This result can be applied to the multicating applications that use the underlying cycle properties on the multi-computer system.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.1
• /
• pp.22-34
• /
• 2002

In this paper, we consider ring embeding problem in faulty (n,k) star graphs which is recently proposed as an alternative interconnection network topology, By effectively utilizing such strategies as series of dimension expansions and even distribution of faulty nodes into sub-stars in graph itself. we prove that it is possible to construct a maximal fault-free ring excluding only faulty nodes when the number of faults is no more than n-3 and $n-k{\geq}2$, and also propose an algorithm which can embed the corresponding ring in (n.k)-star graphs This results will be applied into the multicasting applications that the underlying cycle properties on the multi-computer system.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.1_2
• /
• pp.86-94
• /
• 2004

In this paper, we show that $ G(2^m, 4), m{\geq}3$with at most m-2 faulty elements has a fault-free cycle of length 1 for every ${\leq}1{\leq}2^m-f_v$ is the number of faulty vertices. To achieve our purpose, we define a graph G to be k-fault hypohamiltonian-connected if for any set F of faulty elements, G- F has a fault-free path joining every pair of fault-free vertices whose length is shorter than a hamiltonian path by one, and then show that$ G(2^m, 4), m{\geq}3$ is m-3-fault hypohamiltonian-connected.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.12 no.1
• /
• pp.189-194
• /
• 2017

The reversibility of a quantum logic circuit can be realized when two reversible conditions of information reversible and energy reversible circuits are satisfied. In this paper, we have modeled the computation cycle required to recover the information reversibility from the multivalued quantum logic to the original state. For modeling, we used a function embedding method that uses a unitary switch as an arithmetic exponentiation switch. In the quantum logic circuit, if the adjoint gate pair is symmetric, the unitary switch function shows the balance function characteristic, and it takes 1 cycle operation to recover the original information reversibility. Conversely, if it is an asymmetric structure, it takes two cycle operations by the constant function. In this paper, we show that the problem of 2-cycle restoration according to the asymmetric structure when the hybrid MCT gate is realized with the ternary M-S gate can be solved by equivalent conversion of the asymmetric gate to the gate of the symmetric structure.