Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A \(2\cdot | E |\)-bit distributed algorithm for the directed Euler trail problem

From MaRDI portal
Publication:685488
Jump to:navigation, search

DOI10.1016/0020-0190(93)90155-3zbMath0833.68060OpenAlexW2041906268MaRDI QIDQ685488

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)




Cites Work

  • An efficient distributed algorithm for maximum matching in general graphs
  • Computing Eulerian trails
  • A trade-off between information and communication in broadcast protocols
  • Unnamed Item
  • Unnamed Item


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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:685488&oldid=12594872"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 09:27.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki