A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
[chapter]
2007
Lecture Notes in Computer Science
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest. A well-developed example is the investigation of how the parameter treewidth influences the complexity of (other) graph problems. The reason why such investigations are of general interest is that real-world input distributions for computational problems often inherit structure from the natural computational processes
doi:10.1007/978-3-540-73001-9_28
fatcat:6ctmbq7kgrbfpeer6mpc5pqaja