[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/pact/Nepomniaschaya01>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/A._S._Nepomniaschaya>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1007%2F3-540-44743-1%5F28>
foaf:homepage <https://doi.org/10.1007/3-540-44743-1_28>
dc:identifier DBLP conf/pact/Nepomniaschaya01 (xsd:string)
dc:identifier DOI doi.org%2F10.1007%2F3-540-44743-1%5F28 (xsd:string)
dcterms:issued 2001 (xsd:gYear)
rdfs:label An Associative Version of the Bellman-Ford Algorithm for Finding the Shortest Paths in Directed Graphs. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/A._S._Nepomniaschaya>
swrc:pages 285-292 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/pact/2001>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/pact/Nepomniaschaya01/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/pact/Nepomniaschaya01>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/pact/pact2001.html#Nepomniaschaya01>
rdfs:seeAlso <https://doi.org/10.1007/3-540-44743-1_28>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/pact>
dc:title An Associative Version of the Bellman-Ford Algorithm for Finding the Shortest Paths in Directed Graphs. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document