Shortest \((A+B)\)-path packing via hafnian (Q724248)
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 6910240
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Shortest \((A+B)\)-path packing via hafnian |
scientific article; zbMATH DE number 6910240 |
Statements
Shortest \((A+B)\)-path packing via hafnian (English)
0 references
25 July 2018
0 references
shortest disjoint paths problem
0 references
hafnian
0 references
randomized polynomial-time algorithm
0 references
0.87334305
0 references
0.8625679
0 references
0.8625679
0 references
0.8617252
0 references
0.8617252
0 references
0 references
0 references
0.85462475
0 references
0 references
0 references
