Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs (Q5458836)
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 5267226
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs |
scientific article; zbMATH DE number 5267226 |
Statements
Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs (English)
0 references
24 April 2008
0 references
Series-parallel graphs
0 references
logspace algorithms
0 references
distance problem
0 references
longest path problem
0 references
bounded tree-width
0 references
\(K _{4}\)-minor-free graphs
0 references
0.8571534752845764
0 references
0.8568829298019409
0 references
0.8288378715515137
0 references
0.8232322931289673
0 references
