Shortest Path Queries in Digraphs of Small Treewidth

Chaudhuri, Shiva; Zaroliagis, Christos

doi:10.1007/3-540-60084-1_78

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Shortest Path Queries in Digraphs of Small Treewidth

MPS-Authors

/persons/resource/persons44233

Chaudhuri, Shiva
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45787

Zaroliagis, Christos
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

https://rdcu.be/dv0vg
(Publisher version)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Chaudhuri, S., & Zaroliagis, C. (1995). Shortest Path Queries in Digraphs of Small Treewidth. In Z. Fülöp, & F. Gecseg (Eds.), Automata, Languages, and Programming (pp. 244-255). Berlin: Springer.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-ACC5-7

Abstract

There is no abstract available