Solving shortest paths efficiently on nearly acyclic directed graphs

Shane Saunders; Tadao Takaoka

doi:10.1016/j.tcs.2006.10.008

ScienceGate Book Chapters

JOURNAL ARTICLE

Solving shortest paths efficiently on nearly acyclic directed graphs

Shane Saunders Tadao Takaoka

Year: 2006 Journal: Theoretical Computer Science Vol: 370 (1-3)Pages: 94-109 Publisher: Elsevier BV

DOI: 10.1016/j.tcs.2006.10.008

Get Full-Text PDF Get Analytical Report

Keywords:

Directed acyclic graph Combinatorics Directed graph Computer science Mathematics Shortest path problem Theoretical computer science Discrete mathematics Algorithm Graph

Metrics

Cited By

0.67

FWCI (Field Weighted Citation Impact)

Refs

0.68

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Complexity and Algorithms in Graphs

Physical Sciences → Computer Science → Computational Theory and Mathematics

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Optimization and Search Problems

Physical Sciences → Computer Science → Computer Networks and Communications

Solving shortest paths efficiently on nearly acyclic directed graphs

Metrics

Citation History

Topics

Related Documents

Solving Shortest Paths Efficiently on Nearly Acyclic Directed Graphs

Shortest path algorithms for nearly acyclic directed graphs

Shortest path algorithms for nearly acyclic directed graphs

Counting Approximately-Shortest Paths in Directed Acyclic Graphs

Improved Shortest Path Algorithms for Nearly Acyclic Directed Graphs