Module types 

Auto-generated module

🤖 Generated with SplitRS

Structs

BoundedSearchTree

A bounded search tree algorithm with maximum depth and branching vector.

CognizantFPT

Compression and cross-composition lower bounds for FPT kernels.

ColorCoding

The color-coding technique for randomized FPT algorithms.

ColorCodingFPT

Color-coding FPT implementation with derandomization support.

CourcelleMSOLChecker

Courcelle’s MSO₂ model checker for bounded-treewidth graphs.

CrownDecomposition

Crown decomposition for vertex cover kernelization. Returns (crown vertices, head vertices, reduced graph adjacency).

EtaExpansion

Hardness evidence via eta-expansions and cross-composition.

FPTAlgorithm

A fixed-parameter tractable algorithm with problem, parameter, and complexity.

FPTMethod

FPT (fixed-parameter tractable) algorithm with single-exponential runtime.

IrrelevantVertex

Irrelevant vertex reduction rule for planar FPT algorithms.

IterativeCompressionVC

Iterative compression algorithm for vertex cover. Given a (k+1)-solution, compresses it to a k-solution.

Kernelization

Kernelization: reduce instance to bounded-size kernel.

KernelizationAlgorithm

A kernelization algorithm that reduces a parameterized instance to a kernel.

ParamReduction

Parameterized reduction between problems.

PlanarGraphFPT

Bidimensionality-based FPT algorithm for planar graphs.

TreeDecomp

Tree decomposition node: bags of vertex ids.

TreeDecomposition

A tree decomposition with treewidth and node count.

TreewidthAlgorithm

Treewidth-based algorithm (running in f(tw)·n time).

VertexCoverFPT

Vertex cover FPT algorithm combining LP-based kernelization and bounded search tree.

Enums

KernelSizeBound

WClass

W-hierarchy classification.

WClasses

The W-hierarchy of parameterized complexity classes.