Browsing by Subject "DE-BRUIJN"
Now showing items 1-1 of 1
-
(SPRINGER-VERLAG BERLIN, 2006)Let G = (V, A) be an Eulerian directed graph with an arc-labeling. 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 ...