Hochschulschrift

The domatic number problem: Boolean hierarchy completeness and exact exponential time algorithms

to connected objects

Location
Deutsche Nationalbibliothek Frankfurt am Main
Extent
Online-Ressource
Language
Englisch
Notes
Düsseldorf, Univ., Diss., 2006

Keyword
NP-vollständiges Problem ; Graphentheorie

Creator
Riege, Tobias

URN
urn:nbn:de:hbz:061-20070215-082010-0
Rights
Der Zugriff auf das Objekt ist unbeschränkt möglich.
Last update
25.03.2025, 1:51 PM CET

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

Object type

  • Hochschulschrift

Associated

  • Riege, Tobias

Other Objects (12)

Exact four colorability, exact domatic number problems, and the boolean hierarchy

Exact four colorability, exact domatic number problems, and the boolean hierarchy

Exact exponential algorithms

Exact exponential algorithms

Weak completeness notions for exponential time

Hochschulschrift

Weak completeness notions for exponential time

A hierarchy of algebras for Boolean subsets

A hierarchy of algebras for Boolean subsets

A hierarchy of algebras for Boolean subsets

A hierarchy of algebras for Boolean subsets

On quantified propositional logics and the exponential time hierarchy

On quantified propositional logics and the exponential time hierarchy

Boolean Algebras

Boolean Algebras

Boolean algebras

Boolean algebras

Boolean algebras

Boolean algebras

Boolean Algebras

Boolean Algebras

On different versions of the exact subgraph hierarchy for the stable set problem

On different versions of the exact subgraph hierarchy for the stable set problem

Completeness of Information Sources

Completeness of Information Sources

Related objects