A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks (Q3401090): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1493358325 / rank | |||
Normal rank | |||
Revision as of 01:50, 20 March 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
