- Alternative title
-
Editieren von Graphen mit kleinen Knotengraden unter Nebenbedingungen
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
Berlin, Technische Universität Berlin, Diss., 2014
- Bibliographic citation
-
Foundations of computing ; 2
- Keyword
-
Azyklischer gerichteter Graph
NP-vollständiges Problem
- Event
-
Veröffentlichung
- (where)
-
Berlin
- (who)
-
Universitätsverlag der TU Berlin
- (when)
-
2015
- Creator
- Contributor
-
Niedermeier, Rolf
Müller-Hannemann, Matthias
Thilikos, Dimitrios M.
- URN
-
urn:nbn:de:kobv:83-opus4-65205
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:58 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
- Nichterlein, André
- Niedermeier, Rolf
- Müller-Hannemann, Matthias
- Thilikos, Dimitrios M.
- Universitätsverlag der TU Berlin
Time of origin
- 2015
Other Objects (12)
Degree-constrained editing of small-degree graphs
Polynomial Mappings with Small Degree
Degree constrained subgraph problems and network flow optimization
Topological dynamics of small degree networks
Small Subgraphs with Large Average Degree
Explicit near-Ramanujan graphs of every degree
Minimum Degree Stability of H-Free Graphs
Degree bounds for the circumference of graphs
Embedding spanning bounded degree graphs in randomly perturbed graphs
Inequalities between degree- and distance-based graph invariants
Matching Cut in Graphs with Large Minimum Degree
On the minimum degree of minimal Ramsey graphs
Degree-constrained editing of small-degree graphs
Polynomial Mappings with Small Degree
Degree constrained subgraph problems and network flow optimization
Topological dynamics of small degree networks
Small Subgraphs with Large Average Degree
Explicit near-Ramanujan graphs of every degree
Minimum Degree Stability of H-Free Graphs
Degree bounds for the circumference of graphs
Embedding spanning bounded degree graphs in randomly perturbed graphs
Inequalities between degree- and distance-based graph invariants
Matching Cut in Graphs with Large Minimum Degree
On the minimum degree of minimal Ramsey graphs
Degree-constrained editing of small-degree graphs
Polynomial Mappings with Small Degree
Degree constrained subgraph problems and network flow optimization
Topological dynamics of small degree networks
Small Subgraphs with Large Average Degree
Explicit near-Ramanujan graphs of every degree
Minimum Degree Stability of H-Free Graphs
Degree bounds for the circumference of graphs
Embedding spanning bounded degree graphs in randomly perturbed graphs
Inequalities between degree- and distance-based graph invariants
Matching Cut in Graphs with Large Minimum Degree