共 50 条
The many facets of upper domination
被引:26
|作者:
Bazgan, Cristina
[1
,6
]
Brankovic, Ljiljana
[3
]
Casel, Katrin
[2
]
Fernau, Henning
[2
]
Jansen, Klaus
[5
]
Klein, Kim-Manuel
[5
]
Lampis, Michael
[1
]
Liedloff, Mathieu
[4
]
Monnot, Jerome
[1
]
Paschos, Vangelis Th.
[1
]
机构:
[1] Univ Paris 09, PSL Res Univ, CNRS, LAMSADE, F-75016 Paris, France
[2] Univ Trier, Fachbereich 4, Abt Informat, D-54286 Trier, Germany
[3] Univ Newcastle, Sch Elect Engn & Comp Sci, Callaghan, NSW 2308, Australia
[4] Univ Orleans, INSA, Ctr Val de Loire, LIFO EA 4022, F-45067 Orleans, France
[5] Univ Kiel, Inst Informat, D-24098 Kiel, Germany
[6] Inst Univ France, Paris, France
关键词:
Dominating set;
(In)approximability;
Fixed parameter (in)tractability;
Extension problems;
Bounded-degree graphs;
COMPUTATIONAL-COMPLEXITY;
FAST ALGORITHMS;
UPPER-BOUNDS;
GRAPHS;
APPROXIMATION;
IRREDUNDANCE;
SETS;
INDEPENDENCE;
OPTIMIZATION;
CLIQUE;
D O I:
10.1016/j.tcs.2017.05.042
中图分类号:
TP301 [理论、方法];
学科分类号:
081202 ;
摘要:
This paper studies UPPER DOMINATION, i.e., the problem of computing the maximum cardinality of a minimal dominating set in a graph with respect to classical and parameterised complexity as well as approximability. (C) 2017 Elsevier B.V. All rights reserved.
引用
收藏
页码:2 / 25
页数:24
相关论文