講演抄録/キーワード |
講演名 |
2013-12-20 11:25
大規模グラフにおける距離つき独立支配集合について ○門脇拓史・趙 亮(京大)・Dorothea Wagner(カールスルーエ工科大) COMP2013-42 |
抄録 |
(和) |
(まだ登録されていません) |
(英) |
This paper studies the scaling behavior of the size of a minimum independent distance dominating set (MIDDS) in large-scale real graphs with respect to independence requirement and dominating distance. Due to the NP-hardness of the problem in general, simple and fast heuristics are employed, which are shown to be quite accurate by comparing with lower bounds. As a result, it is shown that the independence requirement of the
dominating set does not increase the size so much. Another interesting observation is that the scaling behavior of the size with respect to the
dominating distance varies according to different types of graphs. In particular, social networks seem to have super exponential scales, whereas road networks and some others have exponential scales. |
キーワード |
(和) |
/ / / / / / / |
(英) |
algorithm / dominating set / independent dominating set / distance dominating set / empirical study / / / |
文献情報 |
信学技報, vol. 113, no. 371, COMP2013-42, pp. 27-31, 2013年12月. |
資料番号 |
COMP2013-42 |
発行日 |
2013-12-13 (COMP) |
ISSN |
Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380 |
著作権に ついて |
技術研究報告に掲載された論文の著作権は電子情報通信学会に帰属します.(許諾番号:10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
PDFダウンロード |
COMP2013-42 |