3. Unweighted Graph Matching🔗

Import the endpoint below for executable perfect search, maximum search, and ordinary native polynomial-time certificates. The mathematical model is the existing Mathlib subgraph of Cslib.Complexity.Graph.induced.

import CslibFrontier.Computability.Complexity.Problems.Graph.Matching.Endpoint

open Cslib.Complexity Cslib.Complexity.Graph Turing.MultiTapeTM

1. 3.1. Search and interpret the result
2. 3.2. Use the resource certificates