Labeled shortest paths in digraphs with negative and positive edge weights
From MaRDI portal
Publication:5321778
DOI10.1051/ita/2009011zbMath1175.68196MaRDI QIDQ5321778
Phillip G. Bradford, David A. Thomas
Publication date: 15 July 2009
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=ITA_2009__43_3_567_0/
68Q25: Analysis of algorithms and problem complexity
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
68Q42: Grammars and rewriting systems
05C85: Graph algorithms (graph-theoretic aspects)
05C20: Directed graphs (digraphs), tournaments
Related Items
Unnamed Item, A Parametrized Analysis of Algorithms on Hierarchical Graphs, Topologically trivial closed walks in directed surface graphs
Cites Work
- Matrix multiplication via arithmetic progressions
- The Exact Path Length Problem
- Engineering Label-Constrained Shortest-Path Algorithms
- Efficient Algorithms for Shortest Paths in Sparse Networks
- Formal-Language-Constrained Path Problems
- Finding Regular Simple Paths in Graph Databases
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item