Computing Eulerian trails

DOI10.1016/0020-0190(88)90170-6MaRDI QIDQ1111387zbMATH OpenOpenAlexFDO

Authors 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) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)

Recommendations

• An algorithm for an Eulerian trail traversing specified edges in given order
• A \(2\cdot | E |\)-bit distributed algorithm for the directed Euler trail problem
• scientific article; zbMATH DE number 790424
• scientific article; zbMATH DE number 3946164
• Enumerating Eulerian trails via Hamiltonian path enumeration

Cites work

• scientific article; zbMATH DE number 3688740 (Why is no real title available?)
• scientific article; zbMATH DE number 3482367 (Why is no real title available?)
• (Some of) the many uses of Eulerian graphs in graph theory (plus some applications)

Cited in

(8)

• A \(2\cdot | E |\)-bit distributed algorithm for the directed Euler trail problem
• The paths with local restrictions
• scientific article; zbMATH DE number 790424 (Why is no real title available?)
• Constant amortized time enumeration of Eulerian trails
• An algorithm for an Eulerian trail traversing specified edges in given order
• DNA physical mapping and alternating Eulerian cycles in colored graphs
• Enumerating Eulerian trails via Hamiltonian path enumeration
• scientific article; zbMATH DE number 3946164 (Why is no real title available?)

This page was built for publication: Computing Eulerian trails

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1111387)