On the advice complexity of the online dominating set problem

to related objects

Location: Deutsche Nationalbibliothek Frankfurt am Main

Extent: Online-Ressource

Language: Englisch

Bibliographic citation: In: 10.1016/j.tcs.2021.01.022

Event: Veröffentlichung

(where): Aachen

(who): Universitätsbibliothek der RWTH Aachen

(when): 2021

Creator: Böckenhauer, Hans-Joachim
Hromkovič, Juraj
Krug, Sacha
Unger, Walter

DOI: 10.18154/RWTH-2021-03044

URN: urn:nbn:de:101:1-2021032903235448464066

Rights: Der Zugriff auf das Objekt ist unbeschränkt möglich.

Last update: 14.08.2025, 10:52 AM CEST

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.

Show original at data provider

Associated

Böckenhauer, Hans-Joachim
Hromkovič, Juraj
Krug, Sacha
Unger, Walter
Universitätsbibliothek der RWTH Aachen

Time of origin

2021

Other Objects (12)

The complexity of blocking (semi)total dominating sets with edge contractions

Hochschulschrift

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

Gemälde

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

Hochschulschrift

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

Gemälde

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

Hochschulschrift

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

Gemälde

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

Cultural heritage institutions wishing to register will find more information here.

Fields marked * need to be filled in.

Username*

Please enter your username

Email*

Please enter your email address

Please do not fill this field

First name

Last name

Password*

Please enter your password

Confirm password*

Please enter the same password

I have read the terms of use and the privacy policy for the collection of personal data and accept them. *

This field is required.

I would like to subscribe to the newsletter of the Deutsche Digitale Bibliothek. See newsletter subscription info.

Account created

Your "My DDB" account has been successfully created. Before you can log in to your account, you must click the confirmation link in the message we just sent to the email address you provided.

On the advice complexity of the online dominating set problem

Object Details

References and Relationships

Contributors, Places and Time

Further information

Data provider

Associated

Time of origin

Other Objects (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

Reconfiguring Dominating Sets in Minor-Closed Graph Classes

Related objects

Reset password