본문 바로가기
  • Home

An Eulerian Cycle Algorithm for Chinese Postman Problem

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2016, 21(7), pp.47-52
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

Sang-Un, Lee 1

1강릉원주대학교

Accredited

ABSTRACT

This paper introduces an algorithm to construct an Eulerian cycle for Chinese postman problem. The Eulerian cycle is formed only when all vertices in the graph have an even degree. Among available algorithms to the Eulerian cycle problem, Edmonds-Johnson’s stands out as the most efficient of its kind. This algorithm constructs a complete graph composed of shortest path between odd-degree vertices and derives the Eulerian cycle through minimum-weight complete matching method, thus running in    . On the contrary, the algorithm proposed in this paper selects minimum weight edge from edges incidental to each vertex and derives the minimum spanning tree (MST) so as to finally obtain the shortest-path edge of odd-degree vertices. The algorithm not only runs in simple linear time complexity  log but also obtains the optimal Eulerian cycle, as the implementation results on 4 different graphs concur.

Citation status

* References for papers published after 2022 are currently being built.