Computing Eulerian trails (Q1111387): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 03:15, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing Eulerian trails |
scientific article |
Statements
Computing Eulerian trails (English)
0 references
1988
0 references
Two linear implementations of Eulerian trail algorithms are described which allows for on-line and off-line traversal of the trails. They use only one length-n array of temporary storage, where n is the number of vertices.
0 references
digraph
0 references
edge-oriented algorithm
0 references
Eulerian trail
0 references
