Çѱ¹Á¤º¸Åë½ÅÇÐȸ ³í¹®Áö (Journal of the Korea Institute of Information and Communication Engineering)
Current Result Document :
ÇѱÛÁ¦¸ñ(Korean Title) |
±×·¡ÇÁÀÇ Á¤Á¡ ¿¬°á¼º¿¡ ´ëÇÑ ÃÖ¼Ò ¹üÀ§ ÇÒ´ç |
¿µ¹®Á¦¸ñ(English Title) |
Minimum Cost Range Assignment for the Vertex Connectivity of Graphs |
ÀúÀÚ(Author) |
ÀÌ¿øÈñ
°º¸À±
±èÀ±Á¤
±èÇö°æ
¹ÚÁ¤±Ô
¹Ú¼öÀÌ
Won-hee Lee
Bo-yun Kang
Yoon-jung Kim
Hyun-kyung Kim
Jung Kyu Park
Su E Park
±èÀçÈÆ
Jae-Hoon Kim
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 21 NO. 11 PP. 2103 ~ 2108 (2017. 11) |
Çѱ۳»¿ë (Korean Abstract) |
mÂ÷¿ø Æò¸é R^m»ó¿¡ n°³ÀÇ Á¡µé pi°¡ ÁÖ¾îÁú ¶§, ¹üÀ§ R¿¡ ´ëÇؼ, Á¡ pi·ÎºÎÅÍ °Å¸® r À̳» Á¡µéÀÇ ÁýÇÕ Ti¸¦ »ý°¢ÇÑ´Ù. m=1ÀÏ ¶§, Ti´Â Á÷¼±»óÀÇ ±¸°£ÀÌ°í, m=2 ÀÏ ¶§, Ti´Â Æò¸é»óÀÇ ¿ø¿¡ ÇØ´çµÈ´Ù. ÁýÇÕ TiµéÀ» Á¤Á¡¿¡ ´ëÀÀÇÏ°í, µÎ ÁýÇÕÀÌ ±³Â÷ÇÏ´Â °æ¿ì¿¡ ´ëÀÀÇÏ´Â µÎ Á¤Á¡ »çÀÌ¿¡ °£¼±À» ¿¬°áÇÏ¸é ±³Â÷ ±×·¡ÇÁ G¸¦ ¾òÀ» ¼ö ÀÖ´Ù. m=1ÀÏ ¶§, G´Â Áø±¸°£ ±×·¡ÇÁ (proper intercal graph), m=2ÀÏ ¶§, G´Â ´ÜÀ§ ¿øÆÇ ±×·¡ÇÁ (unit disk graph)¶ó°í ºÎ¸¥´Ù. º» ³í¹®¿¡¼´Â ¹üÀ§ rÀÌ º¯ÈÇÏ¸é ¹Ù²î´Â ±³Â÷ ±×·¡ÇÁ G(r)¿¡ °ü½ÉÀÌ ÀÖ´Ù. Ưº°È÷ G(r)°¡ ¿¬±Û ±×·¡ÇÁ°¡ µÇ´Â ÃÖ¼Ò rÀ» ã´Â ¹®Á¦¸¦ ´Ù·ê °ÍÀÌ´Ù. ÀÌ ¹®Á¦¿¡ ´ëÇؼ Áø±¸°£ ±×·¡ÇÁ G(r)¿¡ ´ëÇؼ O(n) ½Ã°£ ¾Ë°í¸®Áò, ´ÜÀ§ ¿øÆÇ ±×·¡ÇÁ G(r)¿¡ ´ëÇؼ O((n^2)logn)½Ã°£ ¾Ë°í¸®ÁòÀ» Á¦¾ÈÇÑ´Ù. Á÷¼±»óÀÇ Á¡µéÀÌ Ãß°¡µÇ°Å³ª »èÁ¦µÇ´Â µ¿Àû ȯ°æ ÇÏ¿¡¼ À§ ¹®Á¦¸¦ O(logn)½Ã°£¿¡ ÇØ°áÇÏ´Â ¾Ë°í¸®Áòµµ Á¦¾ÈÇÑ´Ù
|
¿µ¹®³»¿ë (English Abstract) |
For n points pi on the m-dimensional plane R^m and a fixed range r, consider a set Ti containing points the distances from pi of which are less than or equal to r. In case m=1, Ti is an interval on a line, it is a circle on a plane when m=2. For the vertices corresponding to the sets Ti, there is an edge between the vertices if the two sets intersect. Then this graph is called an intersection graph G. For m=1, G is called a proper interval graph and for m=2, it is called an unit disk graph. In this paper, we are concerned in the intersection graph G(r) when r changes. In particular, we consider the problem to find the minimum r such that G(r) is connected. For this problem, we propose an O(n) algorithm for the proper interval graph and an O(n^2logn) algorithm for the unit disk graph. For the dynamic enviroment in which the points on line are added or deleted, we give an O(logn) algorithm for the problem.
|
Å°¿öµå(Keyword) |
³ëÀÎ ¿îµ¿
¸ð¼Ç ÀνÄ
Å°³ØÆ®
Ȩ Æ®·¹ÀÌ´×
Excersice for the elderly
Home Training
Kinect
Motion Recognition
±³Â÷ ±×·¡ÇÁ
´ÜÀ§ ¿øÆÇ ±×·¡ÇÁ
µ¿Àû ȯ°æ
Á¤Á¡ ¿¬°á¼º
Áø±¸°£ ±×·¡ÇÁ
Dynamic Environment
Intersection Graph
Proper Interval Graph
Unit Disk Graph
Vertex Connectivity
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|