• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs.

Andreas JakobyTill Tantau
Published in: FSTTCS (2007)
Keyphrases
  • series parallel
  • binary trees
  • special case
  • optimization problems
  • shortest path
  • message passing