Hochschulschrift
Polynomially solvable cases of hypergraph transversal and related problems
- Alternative title
-
Polynomialzeitlösbare Klassen des Transversalhypergraphen-Problems und verwandte Probleme
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
Saarbrücken, Universität des Saarlandes, Diss., 2011
- Classification
-
Mathematik
- Keyword
-
Graph ; Effizienter Algorithmus ; Algorithmus ; Boolesche Funktion
- Event
-
Veröffentlichung
- (where)
-
Saarbrücken
- (who)
-
Saarländische Universitäts- und Landesbibliothek
- (when)
-
2011
- Creator
-
Rauf, Imran
- Contributor
- URN
-
urn:nbn:de:bsz:291-scidok-44713
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 11:01 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Object type
- Hochschulschrift
Associated
- Rauf, Imran
- Mehlhorn, Kurt
- Saarländische Universitäts- und Landesbibliothek
Time of origin
- 2011
Other Objects (12)
Hypergraph Seminar
Hypergraph Products
Scalable hypergraph partitioning
Massive hypergraph partitioning
Quasi-Exactly Solvable Hamiltonians related to Root Spaces
Bernina transversal
High-Quality Hypergraph Partitioning
The hypergraph assignment problem
Solvable polynomial rings
On Efficiently Solvable Cases of Quantum k-SAT
A decentralized control approach in hypergraph distributed optimization decomposition cases
Coreference resolution via hypergraph partitioning
Hypergraph Seminar
Hypergraph Products
Scalable hypergraph partitioning
Massive hypergraph partitioning
Quasi-Exactly Solvable Hamiltonians related to Root Spaces
Bernina transversal
High-Quality Hypergraph Partitioning
The hypergraph assignment problem
Solvable polynomial rings
On Efficiently Solvable Cases of Quantum k-SAT
A decentralized control approach in hypergraph distributed optimization decomposition cases
Coreference resolution via hypergraph partitioning
Hypergraph Seminar
Hypergraph Products
Scalable hypergraph partitioning
Massive hypergraph partitioning
Quasi-Exactly Solvable Hamiltonians related to Root Spaces
Bernina transversal
High-Quality Hypergraph Partitioning
The hypergraph assignment problem
Solvable polynomial rings
On Efficiently Solvable Cases of Quantum k-SAT
A decentralized control approach in hypergraph distributed optimization decomposition cases