The Multiple Pairs Shortest Path Problem for Sparse Graphs: Exact Algorithms.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/codit/GrappeLM23
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/codit/GrappeLM23
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Mathieu_Lacroix
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Roland_Grappe
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/S%E2%88%9A%C2%A9bastien_Martin
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2FCoDIT58514.2023.10284353
>
foaf:
homepage
<
https://doi.org/10.1109/CoDIT58514.2023.10284353
>
dc:
identifier
DBLP conf/codit/GrappeLM23
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2FCoDIT58514.2023.10284353
(xsd:string)
dcterms:
issued
2023
(xsd:gYear)
rdfs:
label
The Multiple Pairs Shortest Path Problem for Sparse Graphs: Exact Algorithms.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Mathieu_Lacroix
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Roland_Grappe
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/S%E2%88%9A%C2%A9bastien_Martin
>
swrc:
pages
956-961
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/codit/2023
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/codit/GrappeLM23/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/codit/GrappeLM23
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/codit/codit2023.html#GrappeLM23
>
rdfs:
seeAlso
<
https://doi.org/10.1109/CoDIT58514.2023.10284353
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/codit
>
dc:
title
The Multiple Pairs Shortest Path Problem for Sparse Graphs: Exact Algorithms.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document