A linear time algorithm for finding three edge-disjoint paths in Eulerian networks (Q3401090)
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 5664050
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear time algorithm for finding three edge-disjoint paths in Eulerian networks |
scientific article; zbMATH DE number 5664050 |
Statements
A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks (English)
0 references
28 January 2010
0 references
0.8372048735618591
0 references
0.8367899656295776
0 references
0.8003139495849609
0 references
0.7861639857292175
0 references
0.7860226631164551
0 references
