Ergebnisse für: hypergraph supports
Hier findest Du Bücher, die sich mit hypergraph supports beschäftigen.
In this thesis we study the computational complexity of five NP-hard graph problems. It is widely accepted that, in general, NP-hard problems cannot be solved efficiently, that is, in polynomial time, due to many unsuccessful attempts to prove the contrary. Hence, we aim to identify properties of th...