A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Minimal Eulerian Circuit in a Labeled Digraph
[chapter]

2006
*
Lecture Notes in Computer Science
*

Let G = (V, A) be an Eulerian directed graph with an arclabeling. In this work we study the problem of finding an Eulerian circuit of lexicographically minimal label among all Eulerian circuits of the graph. We prove that this problem is NP-hard by showing a reduction from the Directed-Hamiltonian-Circuit problem. If the labeling of the arcs is such that arcs going out from the same vertex have different labels, the problem can be solved in polynomial time. We present an algorithm to construct

doi:10.1007/11682462_67
fatcat:ofrxbv7srjckdiyixs337ef46m