A \(2\cdot | E |\)-bit distributed algorithm for the directed Euler trail problem (Q685488): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A trade-off between information and communication in broadcast protocols / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computing Eulerian trails / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4003439 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4065564 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An efficient distributed algorithm for maximum matching in general graphs / rank | |||
Normal rank | |||
Latest revision as of 09:33, 22 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A \(2\cdot | E |\)-bit distributed algorithm for the directed Euler trail problem |
scientific article |
Statements
A \(2\cdot | E |\)-bit distributed algorithm for the directed Euler trail problem (English)
0 references
17 October 1993
0 references
Euler trail algorithm
0 references
Euler digraph
0 references
