AMS eContent Search Results 




[1] Nathan Albin, Faryad Darabi Sahneh, Max Goering and Pietro PoggiCorradini.
Modulus of families of walks on graphs.
Contemporary Mathematics
699
(2017)
3555.
Book volume table of contents View Article: PDF [2] Nathan Albin, Megan Brunner, Roberto Perez, Pietro PoggiCorradini and Natalie Wiens. Modulus on graphs as a generalization of standard graph theoretic quantities. Conform. Geom. Dyn. 19 (2015) 298317. Abstract, references, and article information View Article: PDF [3] Zubeyir Cinkir. Computation of polarized metrized graph invariants by using discrete Laplacian matrix. Math. Comp. 84 (2015) 29532967. Abstract, references, and article information View Article: PDF [4] Peng Zhang, Yuxiang Gao, Janet Fierson and Yuefan Deng. Eigenanalysisbased task mapping on parallel computers with cellular networks. Math. Comp. 83 (2014) 17271756. Abstract, references, and article information View Article: PDF [5] Henning Meyerhenke. Shape optimizing load balancing for MPIparallel adaptive numerical simulations. Contemporary Mathematics 588 (2013) 6781. Book volume table of contents View Article: PDF [6] Ümit V. Çatalyürek, Mehmet Deveci, Kamer Kaya and Bora Uçar. UMPa: A multiobjective, multilevel partitioner for communication minimization. Contemporary Mathematics 588 (2013) 5365. Book volume table of contents View Article: PDF [7] Hristo Djidjev and Melih Onus. Using graph partitioning for efficient network modularity optimization. Contemporary Mathematics 588 (2013) 103111. Book volume table of contents View Article: PDF [8] Jonathan Dahl. Steiner problems in optimal transport. Trans. Amer. Math. Soc. 363 (2011) 18051819. MR 2746666. Abstract, references, and article information View Article: PDF This article is available free of charge [9] Kamesh Madduri, David Bader, Jonathan Berry and Joseph Crobak. Parallel shortest path algorithms for solving largescale instances. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 74 (2009) 249290. Book volume table of contents View Article: PDF [10] Camil Demetrescu, Andrew V. Goldberg and David S. Johnson (Editors). The Shortest Path Problem. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 74 (2009) MR MR2574218. Book volume table of contents [11] Christopher Barrett, Keith Bisset, Martin Holzer, Goran Konjevod, Madhav Marathe and Dorothea Wagner. Engineering labelconstrained shortestpath algorithms. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 74 (2009) 309319. Book volume table of contents View Article: PDF [12] Holger Bast, Stefan Funke and Domagoj Matijevic. Ultrafast shortestpath queries via transit nodes. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 74 (2009) 175192. Book volume table of contents View Article: PDF [13] Deepak Ajwani, Ulrich Meyer and Vitaly Osipov. Breadth first search on massive graphs. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 74 (2009) 291307. Book volume table of contents View Article: PDF [14] Moritz Hilger, Ekkehard Köhler, Rolf Möhring and Heiko Schilling. Fast pointtopoint shortest path computations with arcflags. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 74 (2009) 4172. Book volume table of contents View Article: PDF [15] J. Santos. Realworld applications of shortest path algorithms. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 74 (2009) 117. Book volume table of contents View Article: PDF [16] Ulrich Lauther. An experimental evaluation of pointtopoint shortest path calculation on road networks with precalculated edgeflags. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 74 (2009) 1939. Book volume table of contents View Article: PDF [17] Andrew Goldberg, Haim Kaplan and Renato Werneck. Reach for A*: shortest path algorithms with preprocessing. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 74 (2009) 93139. Book volume table of contents View Article: PDF [18] Nick Edmonds, Alex Breuer, Douglas Gregor and Andrew Lumsdaine. Singlesource shortest paths with the parallel boost graph library. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 74 (2009) 219248. Book volume table of contents View Article: PDF [19] Daniel Delling, Martin Holzer, Kirill Müller, Frank Schulz and Dorothea Wagner. Highperformance multilevel routing. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 74 (2009) 7391. Book volume table of contents View Article: PDF [20] Daniel Delling, Peter Sanders, Dominik Schultes and Dorothea Wagner. Highway hierarchies star. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 74 (2009) 141174. Book volume table of contents View Article: PDF [21] Peter Sanders and Dominik Schultes. Robust, almost constant time shortestpath queries in road networks. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 74 (2009) 193218. Book volume table of contents View Article: PDF [22] Kamesh Madduri, David Bader, Jonathan Berry and Joseph Crobak. Parallel shortest path algorithms for solving largescale instances. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 74 (2009) 249290. Book volume table of contents View Article: PDF [23] Camil Demetrescu, Andrew V. Goldberg and David S. Johnson (Editors). The Shortest Path Problem. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 74 (2009) MR MR2574218. Book volume table of contents [24] Christopher Barrett, Keith Bisset, Martin Holzer, Goran Konjevod, Madhav Marathe and Dorothea Wagner. Engineering labelconstrained shortestpath algorithms. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 74 (2009) 309319. Book volume table of contents View Article: PDF [25] Holger Bast, Stefan Funke and Domagoj Matijevic. Ultrafast shortestpath queries via transit nodes. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 74 (2009) 175192. Book volume table of contents View Article: PDF [26] Deepak Ajwani, Ulrich Meyer and Vitaly Osipov. Breadth first search on massive graphs. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 74 (2009) 291307. Book volume table of contents View Article: PDF [27] Moritz Hilger, Ekkehard Köhler, Rolf Möhring and Heiko Schilling. Fast pointtopoint shortest path computations with arcflags. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 74 (2009) 4172. Book volume table of contents View Article: PDF [28] J. Santos. Realworld applications of shortest path algorithms. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 74 (2009) 117. Book volume table of contents View Article: PDF [29] Ulrich Lauther. An experimental evaluation of pointtopoint shortest path calculation on road networks with precalculated edgeflags. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 74 (2009) 1939. Book volume table of contents View Article: PDF [30] Andrew Goldberg, Haim Kaplan and Renato Werneck. Reach for A*: shortest path algorithms with preprocessing. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 74 (2009) 93139. Book volume table of contents View Article: PDF 
Results: 1 to 30 of 113 found Go to page: 1 2 3 4 