Algorithms and experiments for parameterized approaches to hard graph problems
Many combinatorial problems that come up in the real world have been classified as NP-hard [Garey and Johnson 1979]. An example is the following task: After a series of experiments, certain pairs of experiments are found to have conflicting results. We therefore know that for each pair, at least one...
|Physical Description:||Online-Ressource (PDF-Datei: 190 S., 2004 KB)|
|Format:||Systemvoraussetzungen: Acrobat reader.|
|QR Code:||Show QR Code|