BOOK-CHAPTER
Counting Approximately-Shortest Paths in Directed Acyclic Graphs
Matúš MihaľákRastislav ŠrámekPeter Widmayer
Year: 2014 Lecture notes in computer science Pages: 156-167 Publisher: Springer Science+Business Media
Keywords:
Combinatorics Shortest path problem Directed acyclic graph Longest path problem Computation Directed graph Discrete mathematics Graph Enhanced Data Rates for GSM Evolution Path graph Mathematics Computer science Algorithm Line graph Graph power
Metrics
8
Cited By
3.02
FWCI (Field Weighted Citation Impact)
19
Refs
0.94
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Citation History
Topics
Markov Chains and Monte Carlo Methods
Physical Sciences → Mathematics → Statistics and Probability
Bayesian Modeling and Causal Inference
Physical Sciences → Computer Science → Artificial Intelligence
Complexity and Algorithms in Graphs
Physical Sciences → Computer Science → Computational Theory and Mathematics
Related Documents
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
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
Shortest paths in almost acyclic graphs
Journal: Operations Research Letters Year: 2000 Vol: 27 (4)Pages: 143-147
DISSERTATION
Paths and directed acyclic graphs
University: Spiral (Imperial College London) Year: 2020