Work

Efficient algorithms for solving shortest paths on nearly acyclic directed graphs

Year: 2005
Type: conference-paper
Language: English
Open Access status: closed
OpenAlex ID: W1530999636
FWCI: 0.246
Cites: 8
Cited by: 2
Related to: 10