Read on Wikipedia

Image: Cmglee · CC BY-SA 4.0

Chinese postman problem

Chinese postman problem

Finding shortest walks through all graph edges.

Super rare
49 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 1,512

Not sold on the market yet.

Readers' pathsAug 2026 – Oct 2026

Readers go next to

Share of the 665 clicks on its links

  1. Travelling salesman problem

    NP-hard problem in combinatorial optimization.

    38%

  2. NP-hardness

    Complexity class.

    10%

  3. Eulerian path

    Trail in a graph that visits each edge once.

    8.9%

  4. NP-completeness

    Complexity class.

    1.7%

Readers come from

Share of the 892 readers arriving from another article

  1. Travelling salesman problem

    NP-hard problem in combinatorial optimization.

    14%

  2. Combinatorial optimization

    Subfield of mathematical optimization.

    8.3%

  3. Eulerian path

    Trail in a graph that visits each edge once.

    7.7%

  4. Vehicle routing problem

    Optimization problem.

    7.5%

  5. Graph theory

    Area of discrete mathematics.

    6.1%

  6. Google Street View

    Interactive street panorama technology.

    4.9%