Computing Eulerian trails

DOI10.1016/0020-0190(88)90170-6zbMATH Open0658.68076OpenAlexW1997938137MaRDI QIDQ1111387FDOQ1111387

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

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

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)

Cites Work

• Title not available (Why is that?)
• (Some of) the many uses of Eulerian graphs in graph theory (plus some applications)
• Title not available (Why is that?)

Cited In (7)

• A \(2\cdot | E |\)-bit distributed algorithm for the directed Euler trail problem
• The paths with local restrictions
• Title not available (Why is that?)
• An algorithm for an Eulerian trail traversing specified edges in given order
• Enumerating Eulerian trails via Hamiltonian path enumeration
• DNA physical mapping and alternating Eulerian cycles in colored graphs
• Title not available (Why is that?)

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)