Computing Eulerian trails

DOI10.1016/0020-0190(88)90170-6zbMath0658.68076OpenAlexW1997938137MaRDI QIDQ1111387

Jürgen Ebert

Publication date: 1988

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(88)90170-6

zbMATH Keywords

digraphEulerian trailedge-oriented algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

DNA physical mapping and alternating Eulerian cycles in colored graphs ⋮ A \(2\cdot | E |\)-bit distributed algorithm for the directed Euler trail problem

Cites Work

• Unnamed Item
• Unnamed Item
• (Some of) the many uses of Eulerian graphs in graph theory (plus some applications)

This page was built for publication: Computing Eulerian trails