Results 271 to 280 of about 1,848,326 (324)

All pairs almost shortest paths

Proceedings of 37th Conference on Foundations of Computer Science, 2000
Summary: Let \(G=(V,E)\) be an unweighted undirected graph on \(n\) vertices. A simple argument shows that computing all distances in \(G\) with an additive one-sided error of at most 1 is as hard as Boolean matrix multiplication. Building on recent work of \textit{D. Aingworth, C. Chekuri, P. Indyk} and \textit{R. Motwani} [SIAM J. Comput. 28, No.
Dor, Dorit, Halperin, Shay, Zwick, Uri
openaire   +2 more sources

Shortest Path Geometric Rounding

Algorithmica, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Node centrality in weighted networks: Generalizing degree and shortest paths

Soc. Networks, 2010
Tore Opsahl, F. Agneessens, J. Skvoretz
semanticscholar   +1 more source

Shortest Paths

2008
Shashi Shekhar, Hui Xiong
  +4 more sources

Single-Source Shortest Paths

Encyclopedia of Algorithms, 2019
Seth Pettie
semanticscholar   +1 more source

Shortest Paths

2021
openaire   +2 more sources

Antibiotic resistance in the patient with cancer: Escalating challenges and paths forward

Ca-A Cancer Journal for Clinicians, 2021
Amila K Nanayakkara, Vance G Fowler, Kevin Outterson   +2 more
exaly  

Fast-Marching Methods for Curvature Penalized Shortest Paths

Journal of Mathematical Imaging and Vision, 2018
J. Mirebeau
semanticscholar   +1 more source

Climate change impacts on plant pathogens, food security and paths forward

Nature Reviews Microbiology, 2023
Brajesh K Singh, Eleonora Egidi, Emilio Guirado   +2 more
exaly  

Shortest Paths

2011
Sanders, P., Singler, J.
openaire   +2 more sources