Publication | Closed Access

Linear time algorithms for NP-hard problems restricted to partial k-trees

EngineeringGraph TheoryCombinatorial ProblemComputational ComplexityTime ComplexityP Versus Np ProblemComputer ScienceNp-hard ProblemsComputational ProblemCombinatorial OptimizationDiscrete Optimization