Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Route_inspection_problem> ?p ?o. }
Showing items 1 to 41 of
41
with 100 items per page.
- Route_inspection_problem abstract "In graph theory, a branch of mathematics, the Chinese postman problem (CPP), postman tour or route inspection problem is to find a shortest closed path or circuit that visits every edge of a (connected) undirected graph. When the graph has an Eulerian circuit (a closed walk that covers every edge once), that circuit is an optimal solution.Alan Goldman of the U.S. National Bureau of Standards first coined the name 'Chinese Postman Problem' for this problem, as it was originally studied by the Chinese mathematician Kwan Mei-Ko in 1962.".
- Route_inspection_problem wikiPageExternalLink ChinesePostmanProblem.html.
- Route_inspection_problem wikiPageID "172564".
- Route_inspection_problem wikiPageRevisionID "603984929".
- Route_inspection_problem hasPhotoCollection Route_inspection_problem.
- Route_inspection_problem subject Category:Computational_problems_in_graph_theory.
- Route_inspection_problem subject Category:NP-complete_problems.
- Route_inspection_problem type Abstraction100002137.
- Route_inspection_problem type Attribute100024264.
- Route_inspection_problem type ComputationalProblemsInGraphTheory.
- Route_inspection_problem type Condition113920835.
- Route_inspection_problem type Difficulty114408086.
- Route_inspection_problem type NP-completeProblems.
- Route_inspection_problem type Problem114410605.
- Route_inspection_problem type State100024720.
- Route_inspection_problem comment "In graph theory, a branch of mathematics, the Chinese postman problem (CPP), postman tour or route inspection problem is to find a shortest closed path or circuit that visits every edge of a (connected) undirected graph. When the graph has an Eulerian circuit (a closed walk that covers every edge once), that circuit is an optimal solution.Alan Goldman of the U.S.".
- Route_inspection_problem label "Briefträgerproblem".
- Route_inspection_problem label "Chinees postbodeprobleem".
- Route_inspection_problem label "Problem chińskiego listonosza".
- Route_inspection_problem label "Problema da inspeção de rotas".
- Route_inspection_problem label "Problema del postino cinese".
- Route_inspection_problem label "Problème du postier chinois".
- Route_inspection_problem label "Route inspection problem".
- Route_inspection_problem label "中国人郵便配達問題".
- Route_inspection_problem label "邮递员问题".
- Route_inspection_problem sameAs Problém_čínského_listonoše.
- Route_inspection_problem sameAs Briefträgerproblem.
- Route_inspection_problem sameAs Problema_del_cartero_chino.
- Route_inspection_problem sameAs Postari_txinatarraren_ebazkizun.
- Route_inspection_problem sameAs Problème_du_postier_chinois.
- Route_inspection_problem sameAs Problema_del_postino_cinese.
- Route_inspection_problem sameAs 中国人郵便配達問題.
- Route_inspection_problem sameAs Chinees_postbodeprobleem.
- Route_inspection_problem sameAs Problem_chińskiego_listonosza.
- Route_inspection_problem sameAs Problema_da_inspeção_de_rotas.
- Route_inspection_problem sameAs m.01779b.
- Route_inspection_problem sameAs Q901096.
- Route_inspection_problem sameAs Q901096.
- Route_inspection_problem sameAs Route_inspection_problem.
- Route_inspection_problem wasDerivedFrom Route_inspection_problem?oldid=603984929.
- Route_inspection_problem isPrimaryTopicOf Route_inspection_problem.