Publication | Closed Access

Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems

Mathematical ProgrammingCluster ComputingCheckable Vertex SubsetEngineeringGraph TheoryPartition (Database)Combinatorial ProblemAlgorithmic EfficiencyComputer ScienceDiscrete MathematicsCombinatorial OptimizationComputational GeometryGraph AlgorithmVertex Partitioning ProblemsFast Dynamic Programming