Shortest \((A+B)\)-path packing via hafnian (Q724248): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s00453-017-0334-0 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00453-017-0334-0 / rank | |||
Normal rank | |||
Revision as of 08:14, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Shortest \((A+B)\)-path packing via hafnian |
scientific article |
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
