AMS eContent Search Results
Matches for: msc=(90C35) AND publication=(all)
Sort order: Date
     

  
Results: 1 to 30 of 113 found      Go to page: 1 2 3 4

[1] Nathan Albin, Faryad Darabi Sahneh, Max Goering and Pietro Poggi-Corradini. Modulus of families of walks on graphs. Contemporary Mathematics 699 (2017) 35-55.
Book volume table of contents
View Article: PDF

[2] Nathan Albin, Megan Brunner, Roberto Perez, Pietro Poggi-Corradini and Natalie Wiens. Modulus on graphs as a generalization of standard graph theoretic quantities. Conform. Geom. Dyn. 19 (2015) 298-317.
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) 2953-2967.
Abstract, references, and article information   
View Article: PDF

[4] Peng Zhang, Yuxiang Gao, Janet Fierson and Yuefan Deng. Eigenanalysis-based task mapping on parallel computers with cellular networks. Math. Comp. 83 (2014) 1727-1756.
Abstract, references, and article information   
View Article: PDF

[5] Henning Meyerhenke. Shape optimizing load balancing for MPI-parallel adaptive numerical simulations. Contemporary Mathematics 588 (2013) 67-81.
Book volume table of contents
View Article: PDF

[6] Ümit V. Çatalyürek, Mehmet Deveci, Kamer Kaya and Bora Uçar. UMPa: A multi-objective, multi-level partitioner for communication minimization. Contemporary Mathematics 588 (2013) 53-65.
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) 103-111.
Book volume table of contents   
View Article: PDF

[8] Jonathan Dahl. Steiner problems in optimal transport. Trans. Amer. Math. Soc. 363 (2011) 1805-1819. 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 large-scale instances. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 74 (2009) 249-290.
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 label-constrained shortest-path algorithms. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 74 (2009) 309-319.
Book volume table of contents
View Article: PDF

[12] Holger Bast, Stefan Funke and Domagoj Matijevic. Ultrafast shortest-path queries via transit nodes. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 74 (2009) 175-192.
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) 291-307.
Book volume table of contents
View Article: PDF

[14] Moritz Hilger, Ekkehard Köhler, Rolf Möhring and Heiko Schilling. Fast point-to-point shortest path computations with arc-flags. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 74 (2009) 41-72.
Book volume table of contents
View Article: PDF

[15] J. Santos. Real-world applications of shortest path algorithms. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 74 (2009) 1-17.
Book volume table of contents
View Article: PDF

[16] Ulrich Lauther. An experimental evaluation of point-to-point shortest path calculation on road networks with precalculated edge-flags. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 74 (2009) 19-39.
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) 93-139.
Book volume table of contents
View Article: PDF

[18] Nick Edmonds, Alex Breuer, Douglas Gregor and Andrew Lumsdaine. Single-source shortest paths with the parallel boost graph library. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 74 (2009) 219-248.
Book volume table of contents
View Article: PDF

[19] Daniel Delling, Martin Holzer, Kirill Müller, Frank Schulz and Dorothea Wagner. High-performance multi-level routing. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 74 (2009) 73-91.
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) 141-174.
Book volume table of contents
View Article: PDF

[21] Peter Sanders and Dominik Schultes. Robust, almost constant time shortest-path queries in road networks. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 74 (2009) 193-218.
Book volume table of contents
View Article: PDF

[22] Kamesh Madduri, David Bader, Jonathan Berry and Joseph Crobak. Parallel shortest path algorithms for solving large-scale instances. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 74 (2009) 249-290.
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 label-constrained shortest-path algorithms. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 74 (2009) 309-319.
Book volume table of contents
View Article: PDF

[25] Holger Bast, Stefan Funke and Domagoj Matijevic. Ultrafast shortest-path queries via transit nodes. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 74 (2009) 175-192.
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) 291-307.
Book volume table of contents
View Article: PDF

[27] Moritz Hilger, Ekkehard Köhler, Rolf Möhring and Heiko Schilling. Fast point-to-point shortest path computations with arc-flags. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 74 (2009) 41-72.
Book volume table of contents
View Article: PDF

[28] J. Santos. Real-world applications of shortest path algorithms. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 74 (2009) 1-17.
Book volume table of contents
View Article: PDF

[29] Ulrich Lauther. An experimental evaluation of point-to-point shortest path calculation on road networks with precalculated edge-flags. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 74 (2009) 19-39.
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) 93-139.
Book volume table of contents
View Article: PDF


Results: 1 to 30 of 113 found      Go to page: 1 2 3 4

American Mathematical Society