A polynomial algorithm for the parity path problem on perfectly orientable graphs (Q1917257)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A polynomial algorithm for the parity path problem on perfectly orientable graphs |
scientific article; zbMATH DE number 897370
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial algorithm for the parity path problem on perfectly orientable graphs |
scientific article; zbMATH DE number 897370 |
Statements
A polynomial algorithm for the parity path problem on perfectly orientable graphs (English)
0 references
7 July 1996
0 references
parity path problem
0 references
0.8955758
0 references
0.8946353
0 references
0.89208984
0 references
0.8805716
0 references
