A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks (Q3401090): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1493358325 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1003.3085 / rank | |||
Normal rank | |||
Latest revision as of 16:23, 19 April 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
