Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs (Q5458836): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:47, 9 February 2024
scientific article; zbMATH DE number 5267226
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
