A 2 | E |-bit distributed algorithm for the directed Euler trail problem

DOI10.1016/0020-0190(93)90155-3MaRDI QIDQ685488zbMATHOpenAlexFDO

Authors Wen-Huei Chen, Chuan Yi Tang

Publication date 17 October 1993

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

Full work available at URL https://doi.org/10.1016/0020-0190(93)90155-3

zbMATH Keywords

Euler digraphEuler trail algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• Derivation of a distributed algorithm for finding paths in directed networks
• scientific article; zbMATH DE number 4014044
• Optimized versions of a distributed algorithm for solving path problems
• scientific article; zbMATH DE number 2036580
• A deterministic almost-tight distributed algorithm for approximating single-source shortest paths
• A deterministic almost-tight distributed algorithm for approximating single-source shortest paths
• Distributed algorithms for computing shortest pairs of disjoint paths
• An ‘All Pairs Shortest Paths’ Distributed Algorithm Using 2n2Messages
• Distributed MST and routing in almost mixing time

Cites work

• scientific article; zbMATH DE number 53191 (Why is no real title available?)
• scientific article; zbMATH DE number 3482367 (Why is no real title available?)
• A trade-off between information and communication in broadcast protocols
• An efficient distributed algorithm for maximum matching in general graphs
• Computing Eulerian trails

Cited in

(1)

• Computing Eulerian trails

This page was built for publication: A \(2\cdot | E |\)-bit distributed algorithm for the directed Euler trail problem

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