Efficient temporal graph processing : shortest paths, closeness centralities and S-cliques
Resource URI: https://dblp.l3s.de/d2r/resource/publications/phd/sg/Ni21
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/phd/sg/Ni21
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Peng_Ni
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.32657%2F10356%2F152573
>
foaf:
homepage
<
https://doi.org/10.32657/10356/152573
>
dc:
identifier
DBLP phd/sg/Ni21
(xsd:string)
dc:
identifier
DOI doi.org%2F10.32657%2F10356%2F152573
(xsd:string)
dcterms:
issued
2021
(xsd:gYear)
rdfs:
label
Efficient temporal graph processing : shortest paths, closeness centralities and S-cliques
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Peng_Ni
>
dc:
publisher
Nanyang Technological University, Singapore
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/phd/sg/Ni21/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/phd/sg/Ni21
>
rdfs:
seeAlso
<
https://doi.org/10.32657/10356/152573
>
dc:
title
Efficient temporal graph processing : shortest paths, closeness centralities and S-cliques
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:PhDThesis
rdf:
type
foaf:Document