Sökning: "DZMITRY SLEDNEU"
Hittade 1 avhandling innehållade orden DZMITRY SLEDNEU.
1. Studies in Efficient Discrete Algorithms
Sammanfattning : This thesis consists of five papers within the design and analysis of efficient algorithms.In the first paper, we consider the problem of computing all-pairs shortest paths in a directed graph with real weights assigned to vertices. We develop a combinatorial randomized algorithm that runs in subcubic time for a special class of graphs. LÄS MER
Resultatsidor:
1