Computing Eulerian trails (Q1111387)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4076644
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing Eulerian trails |
scientific article; zbMATH DE number 4076644 |
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
0.79367995262146
0 references
0.7874763607978821
0 references
0.7747439742088318
0 references
