An Output-Sensitive Algorithm for All-Pairs Shortest Paths in Directed Acyclic Graphs.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/caldam/LingasPS22
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/caldam/LingasPS22
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Andrzej_Lingas
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Dzmitry_Sledneu
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Mia_Persson
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2F978-3-030-95018-7%5F12
>
foaf:
homepage
<
https://doi.org/10.1007/978-3-030-95018-7_12
>
dc:
identifier
DBLP conf/caldam/LingasPS22
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2F978-3-030-95018-7%5F12
(xsd:string)
dcterms:
issued
2022
(xsd:gYear)
rdfs:
label
An Output-Sensitive Algorithm for All-Pairs Shortest Paths in Directed Acyclic Graphs.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Andrzej_Lingas
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Dzmitry_Sledneu
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Mia_Persson
>
swrc:
pages
140-151
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/caldam/2022
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/caldam/LingasPS22/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/caldam/LingasPS22
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/caldam/caldam2022.html#LingasPS22
>
rdfs:
seeAlso
<
https://doi.org/10.1007/978-3-030-95018-7_12
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/caldam
>
dc:
title
An Output-Sensitive Algorithm for All-Pairs Shortest Paths in Directed Acyclic Graphs.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document