Exact algorithms for finding partial edge-disjoint paths (Q1790948)
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 6946773
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact algorithms for finding partial edge-disjoint paths |
scientific article; zbMATH DE number 6946773 |
Statements
Exact algorithms for finding partial edge-disjoint paths (English)
0 references
4 October 2018
0 references
partial edge-disjoint path
0 references
exact algorithm
0 references
directed acyclic graph
0 references
restricted shortest path
0 references
0.8019589781761169
0 references
0.7749096155166626
0 references
0.7729908227920532
0 references
0.771729588508606
0 references
0.7704892754554749
0 references
