JOURNAL ARTICLE
Shortest paths in almost acyclic graphs
Year: 2000 Journal: Operations Research Letters Vol: 27 (4)Pages: 143-147 Publisher: Elsevier BV
Keywords:
Directed acyclic graph Combinatorics Mathematics Computer science Chordal graph Discrete mathematics Graph
Metrics
0
Cited By
0.00
FWCI (Field Weighted Citation Impact)
7
Refs
0.15
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Topics
Advanced Graph Theory Research
Physical Sciences → Computer Science → Computational Theory and Mathematics
Complexity and Algorithms in Graphs
Physical Sciences → Computer Science → Computational Theory and Mathematics
Limits and Structures in Graph Theory
Physical Sciences → Mathematics → Discrete Mathematics and Combinatorics
Related Documents
BOOK-CHAPTER
Counting Approximately-Shortest Paths in Directed Acyclic Graphs
Matúš MihaľákRastislav ŠrámekPeter Widmayer
Lecture notes in computer science Year: 2014 Pages: 156-167
JOURNAL ARTICLE
Solving shortest paths efficiently on nearly acyclic directed graphs
Journal: Theoretical Computer Science Year: 2006 Vol: 370 (1-3)Pages: 94-109
DISSERTATION
Solving Shortest Paths Efficiently on Nearly Acyclic Directed Graphs
University: University of Canterbury Research Repository (University of Canterbury) Year: 2006
JOURNAL ARTICLE
Approximately Counting Approximately-Shortest Paths in Directed Acyclic Graphs
Matúš MihaľákRastislav ŠrámekPeter Widmayer
Journal: Theory of Computing Systems Year: 2014 Vol: 58 (1)Pages: 45-59