- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Ilmenau, Techn. Univ., Diss., 2010
- Urheber
-
Löwenstein, Christian
- URN
-
urn:nbn:de:gbv:ilm1-2010000233
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.01.2025, 06:22 MEZ
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.
Objekttyp
- Hochschulschrift
Beteiligte
- Löwenstein, Christian
Ähnliche Objekte (12)
Partitioning a graph into a dominating set, a total dominating set, and something else
The Dominating Set Problem in Geometric Intersection Graphs
Kernelization and Sparseness: the Case of Dominating Set
Disjoint Paired-Dominating sets in Cubic Graphs
Dominating
On the advice complexity of the online dominating set problem
Random procedures for dominating sets in bipartite graphs
Reconfiguring dominating sets in minor-closed graph classes
Reconfiguring Dominating Sets in Minor-Closed Graph Classes
Self-organizing construction of connected k-hop dominating sets in wireless sensor networks
Near-optimal distributed dominating set in bounded arboricity graphs
Solving nonconvex planar location problems by finite dominating sets
Partitioning a graph into a dominating set, a total dominating set, and something else
The Dominating Set Problem in Geometric Intersection Graphs
Kernelization and Sparseness: the Case of Dominating Set
Disjoint Paired-Dominating sets in Cubic Graphs
Dominating
On the advice complexity of the online dominating set problem
Random procedures for dominating sets in bipartite graphs
Reconfiguring dominating sets in minor-closed graph classes
Reconfiguring Dominating Sets in Minor-Closed Graph Classes
Self-organizing construction of connected k-hop dominating sets in wireless sensor networks
Near-optimal distributed dominating set in bounded arboricity graphs
Solving nonconvex planar location problems by finite dominating sets
Partitioning a graph into a dominating set, a total dominating set, and something else
The Dominating Set Problem in Geometric Intersection Graphs
Kernelization and Sparseness: the Case of Dominating Set
Disjoint Paired-Dominating sets in Cubic Graphs
Dominating
On the advice complexity of the online dominating set problem
Random procedures for dominating sets in bipartite graphs
Reconfiguring dominating sets in minor-closed graph classes
Reconfiguring Dominating Sets in Minor-Closed Graph Classes
Self-organizing construction of connected k-hop dominating sets in wireless sensor networks
Near-optimal distributed dominating set in bounded arboricity graphs