Minimal Eulerian Circuit in a Labeled Digraph

DOI10.1007/11682462_67zbMath1145.05310OpenAlexW1555894988WikidataQ57707488 ScholiaQ57707488MaRDI QIDQ3525806

Eduardo Moreno, Martin Matamala

Publication date: 18 September 2008

Published in: LATIN 2006: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11682462_67

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

On the complexity of the Eulerian closed walk with precedence path constraints problem ⋮ Minimum Eulerian circuits and minimum de Bruijn sequences

This page was built for publication: Minimal Eulerian Circuit in a Labeled Digraph