English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 DetailsSummary
  Shortest Path Queries in Digraphs of Small Treewidth

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: 22nd International Colloquium (ICALP95) (pp. 244-255). Berlin: Springer.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-ACC5-7 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-ACC6-5
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Chaudhuri, Shiva1, Author           
Zaroliagis, Christos1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-021995
 Publication Status: Issued
 Pages: -
 Publishing info: Berlin : Springer
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 517775
Other: Local-ID: C1256428004B93B8-7AF9040DFB113B61C12564590042C9F0-Shiva-Zaro-1-95
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Szeged, Hungary
Start-/End Date: -

Legal Case

show

Project information

show

Source 1

show
hide
Title: Automata, Languages, and Programming: 22nd International Colloquium (ICALP95)
Source Genre: Proceedings
 Creator(s):
Fülöp, Zoltán, Editor
Gecseg, Ferenc, Editor
Affiliations:
-
Publ. Info: Berlin : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 244 - 255 Identifier: -

Source 2

show
hide
Title: Lecture Notes in Computer Science
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: - Identifier: -