- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
In: 10.1016/j.tcs.2021.01.022
- Ereignis
-
Veröffentlichung
- (wo)
-
Aachen
- (wer)
-
Universitätsbibliothek der RWTH Aachen
- (wann)
-
2021
- Urheber
-
Böckenhauer, Hans-Joachim
Hromkovič, Juraj
Krug, Sacha
Unger, Walter
- DOI
-
10.18154/RWTH-2021-03044
- URN
-
urn:nbn:de:101:1-2021032903235448464066
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:52 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Böckenhauer, Hans-Joachim
- Hromkovič, Juraj
- Krug, Sacha
- Unger, Walter
- Universitätsbibliothek der RWTH Aachen
Entstanden
- 2021
Ähnliche Objekte (12)
The complexity of blocking (semi)total dominating sets with edge contractions
In the complement of a dominating set
Kernelization and Sparseness: the Case of Dominating Set
The Dominating Set Problem in Geometric Intersection Graphs
Partitioning a graph into a dominating set, a total dominating set, and something else
Disjoint Paired-Dominating sets in Cubic Graphs
Complexity-restricted advice functions
Dominating
Solving the k-dominating set problem on very large-scale networks
Random procedures for dominating sets in bipartite graphs
Reconfiguring dominating sets in minor-closed graph classes
Reconfiguring Dominating Sets in Minor-Closed Graph Classes
The complexity of blocking (semi)total dominating sets with edge contractions
In the complement of a dominating set
Kernelization and Sparseness: the Case of Dominating Set
The Dominating Set Problem in Geometric Intersection Graphs
Partitioning a graph into a dominating set, a total dominating set, and something else
Disjoint Paired-Dominating sets in Cubic Graphs
Complexity-restricted advice functions
Dominating
Solving the k-dominating set problem on very large-scale networks
Random procedures for dominating sets in bipartite graphs
Reconfiguring dominating sets in minor-closed graph classes
Reconfiguring Dominating Sets in Minor-Closed Graph Classes
The complexity of blocking (semi)total dominating sets with edge contractions
In the complement of a dominating set
Kernelization and Sparseness: the Case of Dominating Set
The Dominating Set Problem in Geometric Intersection Graphs
Partitioning a graph into a dominating set, a total dominating set, and something else
Disjoint Paired-Dominating sets in Cubic Graphs
Complexity-restricted advice functions
Dominating
Solving the k-dominating set problem on very large-scale networks
Random procedures for dominating sets in bipartite graphs
Reconfiguring dominating sets in minor-closed graph classes