Shortest \(k\)-disjoint paths via determinants (Q5090955)
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 7561324
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Shortest \(k\)-disjoint paths via determinants |
scientific article; zbMATH DE number 7561324 |
Statements
21 July 2022
0 references
disjoint paths
0 references
planar graph
0 references
parallel algorithm
0 references
cycle cover
0 references
determinant
0 references
inclusion-exclusion
0 references
0 references
0.8203453421592712
0 references
0.8085806965827942
0 references
0.8031293749809265
0 references
0.8002792596817017
0 references
0.799931526184082
0 references
