Read on Wikipedia

Image: BagLuke · CC0

Subgraph isomorphism problem

Subgraph isomorphism problem

Problem in theoretical computer science.

Super rare
19 views/day0 owners

No account needed. By playing, you confirm you're 13 or older and agree to the Terms of use.

No owners yet

Super rareTop 12%

Category: Empty

0 owners
0 copies
0 pulls
Wishlisted
0
In 0 albums
On 0 showcases
Market listings
0
Wikipedia views per dayLast 30 days 632

Not sold on the market yet.

Readers' pathsAug 2026 – Oct 2026

Readers go next to

Share of the 177 clicks on its links

  1. Graph isomorphism

    Bijection between the vertex set of two graphs.

    34%

  2. Clique problem

    Task of computing complete subgraphs.

    33%

  3. Hamiltonian path

    Path in a graph that visits each vertex exactly once.

    23%

  4. NP-completeness

    Complexity class.

    9.6%

Readers come from

Share of the 327 readers arriving from another article

  1. NP-completeness

    Complexity class.

    20%

  2. Graph isomorphism problem

    Unsolved problem in computational complexity theory.

    15%

  3. Graph isomorphism

    Bijection between the vertex set of two graphs.

    8.3%

  4. NP (complexity)

    Complexity class used to classify decision problems.

    8%

  5. Graph theory

    Area of discrete mathematics.

    4.9%