Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 4 of 4 for “"Parametrisierte Komplexität"”.
-
Parameterized Algorithmics for Network Analysis
Diese Arbeit beschäftigt sich mit der parametrisierten Komplexität NP-schwerer Berechnungsprobleme aus zwei Bereichen der Netzwerkanalyse: dem Clustern von Netzwerken und dem Querying von Netzwerken. Der Fokus liegt hierbei auf der Identifizierung neuer problemspezifischer Parameter, welche als …
-
Exact algorithms based on specific complexity measures for hard problems
At present, most of the important computational problems - be they decision, search, or optimization problems - are known to satisfy one of the following two criteria:(1) The problem can be solved in polynomial time with respect to the input size n, where the degree of the polynomial is small …
-
Intuitive algorithms
Assuming that P does not equal NP, which is widely believed to be true, many important computational problems are not solvable in polynomial time. However, this does not imply that NP-hard problems are not exactly solvable at all. Both the concepts of moderately exponential time algorithms and …
-
Free-boundary problem of crack dynamics: phase field modeling
This thesis describes the behavior of cracks and pores under the influence of elastic and curvature effects. In a continuum theory approach, these structure deformations are treated as free moving boundaries. Our investigation start with well established sharp interface equations for which no fully …