About: Distributed Shortest Paths for Directed Graphs with Negative Edge Lengths     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • A distributed algorithm for single source shortest path problem in an arbitrary directed graph which can contain negative length cycles is presented. The new algorithm is a label-correcting one and uses a novel way for detection of negative length cycles. It works on a network of processors with disjoint memory that communicate via message passing. Correctness of the algorithm is proved. The algorithm is work-efficient as its worst time complexity is O(n^3/p), where p is the number of processors.
  • A distributed algorithm for single source shortest path problem in an arbitrary directed graph which can contain negative length cycles is presented. The new algorithm is a label-correcting one and uses a novel way for detection of negative length cycles. It works on a network of processors with disjoint memory that communicate via message passing. Correctness of the algorithm is proved. The algorithm is work-efficient as its worst time complexity is O(n^3/p), where p is the number of processors. (en)
Title
  • Distributed Shortest Paths for Directed Graphs with Negative Edge Lengths
  • Distributed Shortest Paths for Directed Graphs with Negative Edge Lengths (en)
skos:prefLabel
  • Distributed Shortest Paths for Directed Graphs with Negative Edge Lengths
  • Distributed Shortest Paths for Directed Graphs with Negative Edge Lengths (en)
skos:notation
  • RIV/00216224:14330/01:00004836!RIV/2002/GA0/143302/N
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GA201/00/1023), Z(MSM 143300001)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 677965
http://linked.open...ai/riv/idVysledku
  • RIV/00216224:14330/01:00004836
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Distributed Shortest Paths for Directed Graphs with Negative Edge Lengths (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [1969614A04C8]
http://linked.open...i/riv/mistoVydani
  • Brno
http://linked.open...vEdiceCisloSvazku
  • Technical Reports, FIMU-RS-2001-01
http://linked.open...i/riv/nazevZdroje
  • Distributed Shortest Paths for Directed Graphs with Negative Edge Lengths
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...v/pocetStranKnihy
http://linked.open...cetTvurcuVysledku
http://linked.open...ocetUcastnikuAkce
http://linked.open...nichUcastnikuAkce
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Brim, Luboš
  • Černá, Ivana
  • Pelánek, Radek
  • Krčál, Pavel
http://linked.open...n/vavai/riv/zamer
number of pages
http://purl.org/ne...btex#hasPublisher
  • Masarykova univerzita. Fakulta informatiky
http://localhost/t...ganizacniJednotka
  • 14330
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 85 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software