1 problem

Matching

Induced subgraph isomorphism hardness conjecture for bipartite permutation graphs
Induced subgraph isomorphism hardness conjecture. Unless $\mathrm{P}=\mathrm{NP}$ , the induced subgraph isomorphism problem is NP-hard in $\mathcal X$ if and only if $\mathcal X$ c…
openbipartite-permutation-graphs computational-complexity induced-subgraph-isomorphism
08

Induced subgraph isomorphism hardness conjecture for bipartite permutation graphs