• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.1
• /
• pp.149-154
• /
• 2024

This paper proposes an algorithm that remedy Floyd's the tortoise and the hare algorithm (THA) shortcomings which is specialized in singly linked list (SLL), so this algorithm fails to detect the cycle in undirected graph, digraph, and tree with multiple inputs or outputs. The proposed algorithm simply pruning the source and sink with only one edge using cycle detection of single edge node pruning. As a result of the experimental of various list, undirected graph, digraph, and tree, the proposed algorithm can be successively detect the cycle all of them. Thus, the proposed algorithm has the simplest and fastest advantage in the field of cycle detection.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.6
• /
• pp.91-97
• /
• 2022

There is hare and tortoise racing algorithm(HTA) for single-source(SS) singly linked list(SLL) with O(n) time complexity. But the fast method is unknown for general graph with multi-source, multi-destination, and multi-branch(MSMDMB). This paper suggests linear time cycle detection algorithm for given undirected and digraph with MSMDMB. The proposed method reduced the given graph G contained with unnecessary vertices(or nodes) to cycle into reduced graph G' with only necessary vertices(or nodes) to cycle based on the condition of cycle formation. For the reduced graph G', we can be find the cycle set C and cycle length λ using linear search within linear time. As a result of experiment data, the proposed algorithm can be obtained the cycle for whole data.

• Journal of Digital Convergence
• /
• v.7 no.1
• /
• pp.125-136
• /
• 2009

SK Communications entered Korean instant messenger market as a late-mover in 2001 and its instant messenger service "NateOn" was placed in competition with Microsoft's "MSN Messenger", the leading service provider at the time. NateOn studied the nature of users accurately and gradually increased its market share through various services, and in September 2005, it succeeded in overtaking MSN as No.1 in the market. The success of NateOn is a case where a late-mover overcame the buddy-list network, a powerful competitive advantage, of the incumbent. By studying the changes in the instant messenger market of Korea, we try to examine the causes of NateOn's victory and MSN's loss. Through this, we wish to give implications for managers who endeavor to discover the internal and external strategies the leading business has to implement to remain ahead, and how a late-mover can overcome the lack of resources and capacity to leave a mark in the market.