[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/algorithmica/Han08>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Yijie_Han>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1007%2Fs00453-007-9063-0>
foaf:homepage <https://doi.org/10.1007/s00453-007-9063-0>
dc:identifier DBLP journals/algorithmica/Han08 (xsd:string)
dc:identifier DOI doi.org%2F10.1007%2Fs00453-007-9063-0 (xsd:string)
dcterms:issued 2008 (xsd:gYear)
swrc:journal <https://dblp.l3s.de/d2r/resource/journals/algorithmica>
rdfs:label An O ( n 3(log log n /log n )5/4) Time Algorithm for All Pairs Shortest Path. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Yijie_Han>
swrc:number 4 (xsd:string)
swrc:pages 428-434 (xsd:string)
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/algorithmica/Han08/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/algorithmica/Han08>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica51.html#Han08>
rdfs:seeAlso <https://doi.org/10.1007/s00453-007-9063-0>
dc:subject Algorithms; Complexity; Graph algorithms; Shortest path (xsd:string)
dc:title An O ( n 3(log log n /log n )5/4) Time Algorithm for All Pairs Shortest Path. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 51 (xsd:string)