On connected dominating set games

다국어 초록 (Multilingual Abstract)

Many authors studied cooperative games that arise from variants of dominating set games on graphs. In wireless networks, the connected dominating set is used to reduce routing table size and communication cost. In this paper, we introduce a connected dominating set game to model the cost allocation problem arising from a connected dominating set on a given graph and study its core. In addition, we give a polynomial time algorithm for determining the balancedness of the game on a tree, for finding an element of the core.

참고문헌 (Reference)

1 나명환, "파라미터 설계에서 신경망을 이용한 최적화 방안" 한국데이터정보과학회 20 (20): 829-835, 2009

2 김혜경, "일반화된 분수 지배게임에 대한 균형성" 한국데이터정보과학회 20 (20): 49-55, 2009

3 Park, B., "On the cores of games arising from integer edge covering functions of graphs" preprint 2011

4 Velzen, B. V., "Dominating set games" 32 : 565-573, 2004

5 배인한, "Design and evaluation of an alert message dissemination algorithm using fuzzy logic for VANETs" 한국데이터정보과학회 21 (21): 783-793, 2010

6 Bilbao, J., "Cooperative games on combinatorial structures" Kluwer Academic Publishers 2000

7 Liu, Y, "Balanceness of edge covering games" 20 : 1064-1069, 2007

8 김혜경, "Balancedness of Integer Domination Games" 대한수학회 43 (43): 297-309, 2006

9 Haynes, T. W., "Algorithmic aspects of the core of combinatorial optimization games" Marcel Dekker Inc 1998

10 Deng, X., "Algorithmic aspects of the core of combinatorial opti-mization games" 24 : 751-766, 1999