A linear algorithm for the all-bidirectional-edges problem on planar graphs (Q1209732)
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 168415
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear algorithm for the all-bidirectional-edges problem on planar graphs |
scientific article; zbMATH DE number 168415 |
Statements
A linear algorithm for the all-bidirectional-edges problem on planar graphs (English)
0 references
16 May 1993
0 references
graph algorithms
0 references
all-bidirectional-edges problem
0 references
edge-labeling
0 references
path
0 references
planar graph
0 references
0.8148717284202576
0 references
0.8136618733406067
0 references
0.8121464848518372
0 references
0.7630308866500854
0 references
0.762078046798706
0 references
