Finding an Even Simple Path in a Directed Planar Graph (Q4943840)
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 1417061
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding an Even Simple Path in a Directed Planar Graph |
scientific article; zbMATH DE number 1417061 |
Statements
Finding an Even Simple Path in a Directed Planar Graph (English)
0 references
19 March 2000
0 references
labeled directed graphs
0 references
NP-completeness
0 references
polynomial-time algorithms
0 references
regular expressions
0 references
simple paths
0 references
planar graphs
0 references
0.8893147706985474
0 references
0.7833794355392456
0 references
0.7782757878303528
0 references
0.7663781046867371
0 references
