EntityQ901096· pop 22· linked from 19 articlesroute inspection problemSign in to savein graph theory, the problem to find a shortest closed path or circuit that visits every edge of an undirected graphConnectionsNational Institute of Standards and TechnologyEntityEulerian pathEntityInternational Standard Book NumberEntityalgorithmEntitydigital object identifierEntitygraph theoryEntitygraphEntitytravelling salesperson problemEntitycomplete graphEntityMathWorldEntityQ22908627EntityNP-completeEntitydegreeEntitytime complexityEntityHandle SystemEntityEric W. WeissteinEntityNP-hardEntityMathematical ReviewsEntitymatchingEntityloopless multigraphEntityCategoriesComputational problems in graph theoryNP-complete problems