A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs

Andrzej Lingas, Dzmitry Sledneu

Forskningsoutput: Kapitel i bok/rapport/Conference proceeding › Konferenspaper i proceeding › Peer review

Fingeravtryck

Fördjupa i forskningsämnen för ”A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs”. Tillsammans bildar de ett unikt fingeravtryck.

Computer Science

Mathematics