"Chinese postman problem" meaning in All languages combined

{
  "etymology_text": "Originally studied by the Chinese mathematician Kwan Mei-Ko in 1960, whose Chinese paper was translated into English in 1962. The name \"Chinese postman problem\" was coined in his honour, and is varyingly ascribed to Alan J. Goldman or Jack Edmonds, both of the US National Bureau of Standards.",
  "forms": [
    {
      "form": "Chinese postman problems",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "Chinese postman problem (plural Chinese postman problems)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Graph theory",
          "orig": "en:Graph theory",
          "parents": [
            "Mathematics",
            "Visualization",
            "Formal sciences",
            "Computing",
            "Interdisciplinary fields",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "The problem of finding the shortest closed path or circuit that visits every edge of a (connected) undirected graph."
      ],
      "id": "en-Chinese_postman_problem-en-noun-P7L2Ou-p",
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "short",
          "short"
        ],
        [
          "closed",
          "closed"
        ],
        [
          "path",
          "path"
        ],
        [
          "circuit",
          "circuit"
        ],
        [
          "visit",
          "visit"
        ],
        [
          "edge",
          "edge"
        ],
        [
          "connected",
          "connected"
        ],
        [
          "undirected graph",
          "undirected graph"
        ]
      ],
      "raw_glosses": [
        "(graph theory) The problem of finding the shortest closed path or circuit that visits every edge of a (connected) undirected graph."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "Chinese postman problem"
      ]
    }
  ],
  "word": "Chinese postman problem"
}

{
  "etymology_text": "Originally studied by the Chinese mathematician Kwan Mei-Ko in 1960, whose Chinese paper was translated into English in 1962. The name \"Chinese postman problem\" was coined in his honour, and is varyingly ascribed to Alan J. Goldman or Jack Edmonds, both of the US National Bureau of Standards.",
  "forms": [
    {
      "form": "Chinese postman problems",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "Chinese postman problem (plural Chinese postman problems)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Graph theory"
      ],
      "glosses": [
        "The problem of finding the shortest closed path or circuit that visits every edge of a (connected) undirected graph."
      ],
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "short",
          "short"
        ],
        [
          "closed",
          "closed"
        ],
        [
          "path",
          "path"
        ],
        [
          "circuit",
          "circuit"
        ],
        [
          "visit",
          "visit"
        ],
        [
          "edge",
          "edge"
        ],
        [
          "connected",
          "connected"
        ],
        [
          "undirected graph",
          "undirected graph"
        ]
      ],
      "raw_glosses": [
        "(graph theory) The problem of finding the shortest closed path or circuit that visits every edge of a (connected) undirected graph."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "Chinese postman problem"
      ]
    }
  ],
  "word": "Chinese postman problem"
}