Publication | Closed Access

On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic

Fixed Parameter ComplexityMonadic Second-order LogicGraph TheoryEngineeringParameterized ComplexityAutomated ReasoningComputability TheoryProof ComplexityAbstract ComplexityComputational ComplexityTime ComplexityComputer ScienceDiscrete MathematicsGraph Enumeration Problems