A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks (Q3401090): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:11, 4 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks |
scientific article |
Statements
A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks (English)
0 references
28 January 2010
0 references
