Polylog-time and near-linear work approximation scheme for undirected shortest paths: Polylog-time and near-linear work approximation scheme for undirected shortest paths.

Authors: Edith Cohen

Source: Journal of the ACM. 47:132-166

Subject Terms: faster sequential algorithms, transitive closure bottleneck, polylog-time randomized algorithm, Graph theory (including graph drawing) in computer science, Randomized algorithms, Analysis of algorithms, weighted undirected networks, sparse hop sets, near-linear work algorithms, Approximation algorithms

File Description: application/xml

Access URL: http://www.cohenwang.com/edith/Papers/nobot.pdf
https://zbmath.org/1935197
https://doi.org/10.1145/331605.331610

A Randomized Linear-Work EREW PRAM Algorithm to Find a Minimum Spanning Forest

Authors: Keung Poon, Chung, Ramachandran, Vijaya

Source: Algorithmica. March 2003 35(3):257-268

DECENTRALIZED LOW-STRETCH TREES VIA LOW DIAMETER GRAPH DECOMPOSITIONS.

Authors: BECKER, RUBEN, EMEK, YUVAL, GHAFFARI, MOHSEN, LENZEN, CHRISTOPH

Source: SIAM Journal on Computing; 2024, Vol. 53 Issue 2, p247-286, 40p

Subject Terms: Weighted graphs, Undirected graphs, Spanning trees, Graph algorithms, Diameter, Computational complexity, Baby strollers

Efficient parallel factorization and solution of structured and unstructured linear systems

Authors: Reif, John H.

Source: In Journal of Computer and System Sciences 2005 71(1):86-143

On the complexity of local distributed graph problems

Authors: Ghaffari, Mohsen, Kuhn, Fabian, Maus, Yannic

Source: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing. :784-797

Availability: http://dl.acm.org/doi/10.1145/3055399.3055471

FAST ALGORITHMS FOR CONSTRUCTING t-SPANNERS AND PATHS WITH STRETCH t.

Authors: Cohen, Edith

Source: SIAM Journal on Computing; 1998, Vol. 28 Issue 1, p210, 27p

Subject Terms: Algorithms, Graphic methods

Neighborhood graphs and distributed Δ+1-coloring

Authors: Kelsen, Pierre^Aff1

Contributors: Goos, G., editor, Hartmanis, J., editor, van Leeuwen, J., editor, Karlsson, Rolf, editor, Lingas, Andrzej, editor

Source: Algorithm Theory — SWAT'96 : 5th Scandinavian Workshop on Algorithm Theory Reykjavík, Iceland, July 3–5, 1996 Proceedings. 1097:223-233

A randomized linear work EREW PRAM algorithm to find a minimum spanning forest

Authors: Poon, Chung Keung^Aff1, Ramachandran, Vijaya^Aff2

Contributors: Goos, Gerhard, editor, Hartmanis, Juris, editor, van Leeuwen, Jan, editor, Leong, Hon Wai, editor, Imai, Hiroshi, editor, Jain, Sanjay, editor

Source: Algorithms and Computation : 8th International Symposium, ISAAC '97 Singapore, December 17–19, 1997 Proceedings. 1350:212-222

Bounded length UCFG equivalence

Authors: Litow, B.^Aff1

Contributors: Goos, Gerhard, editor, Hartmanis, Juris, editor, van Leeuwen, Jan, editor, Asano, Tetsuo, editor, Igarashi, Yoshihide, editor, Nagamochi, Hiroshi, editor, Miyano, Satoru, editor, Suri, Subhash, editor

Source: Algorithms and Computation : 7th International Symposium, ISAAC '96 Osaka, Japan, December 16–18, 1996 Proceedings. 1178:239-246

LOWER BOUNDS FOR LOCAL MONOTONICITY RECONSTRUCTION FROM TRANSITIVE-CLOSURE SPANNERS.

Authors: Bhattacharyya, Arnab, Grigorescu, Elena, Jha, Madhav, Jungh, Kyomin, Raskhodnikova, Sofya, Woodruff, David P.

Source: SIAM Journal on Discrete Mathematics; 2012, Vol. 26 Issue 2, p618-646, 29p, 8 Diagrams, 2 Charts

Subject Terms: Mathematical functions, Hypercubes, Directed graphs, Integers, Data structures, Algorithms

Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time.

Authors: Bhattacharya, Sayan, Kiss, Peter, Saranurak, Thatchaphol, Wajc, David

Source: Journal of the ACM; Oct2024, Vol. 71 Issue 5, p1-32, 32p

Subject Terms: Graph algorithms, Open-ended questions, Algorithms

Randomized Minimum Spanning Tree Algorithms Using Exponentially Fewer Random Bits.

Authors: Pettie, Seth, Ramachandran, Vijaya

Source: ACM Transactions on Algorithms; 2008, Vol. 4 Issue 1, p5:1-5:27, 27p, 1 Diagram, 5 Charts

Subject Terms: Spanning trees, Algorithms, Linear systems, Tree graphs, Algebra

Polylog-Time and Near-Linear Work Approximation Scheme for Undirected Shortest Paths

Authors: Edith Cohen

Contributors: The Pennsylvania State University CiteSeerX Archives

Source: http://www.cohenwang.com/edith/Papers/nobot.pdf.

File Description: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.385.7644; http://www.cohenwang.com/edith/Papers/nobot.pdf

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.385.7644
http://www.cohenwang.com/edith/Papers/nobot.pdf

Space-Efficient Randomized Algorithms for K-SUM.

Authors: Wang, Joshua R.

Source: Algorithms - ESA 2014; 2014, p810-829, 20p

A DETERMINISTIC ALMOST-TIGHT DISTRIBUTED ALGORITHM FOR APPROXIMATING SINGLE-SOURCE SHORTEST PATHS.

Authors: HENZINGER, MONIKA, KRINNINGER, SEBASTIAN, NANONGKAI, DANUPON

Source: SIAM Journal on Computing; 2021, Vol. 50 Issue 3, p98-137, 40p

Subject Terms: Algorithms, Deterministic algorithms, Distributed algorithms, Deterministic processes, Mathematics

Geographic Terms: Thailand, Germany

Implementation of Parallel Algorithms

Authors: Reif, John H.

Contributors: DUKE UNIV DURHAM NC

Source: DTIC AND NTIS

Subject Terms: Operations Research, Computer Programming and Software, ALGORITHMS, PARALLEL PROCESSING, MATHEMATICAL PROGRAMMING, COMPUTER PROGRAMS, OPTICAL PROCESSING, INPUT OUTPUT MODELS, THREE DIMENSIONAL, LINEAR SYSTEMS, ROBOTICS, PARALLEL ALGORITHMS, POLYLOG TIME, FRACTORIZATIONS, TAGGED MEMORY, RANDOMIZED ALGORITHMS, VLSR(VERY LARGE SCALE ROBOTICS)

File Description: text/html

Relation: http://www.dtic.mil/docs/citations/ADA275803

Availability: http://www.dtic.mil/docs/citations/ADA275803
http://oai.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=ADA275803

NEAR-OPTIMAL APPROXIMATE SHORTEST PATHS AND TRANSSHIPMENT IN DISTRIBUTED AND STREAMING MODELS.

Authors: BECKER, RUBEN, FORSTER, SEBASTIAN, KARRENBAUER, ANDREAS, LENZEN, CHRISTOPH

Source: SIAM Journal on Computing; 2021, Vol. 50 Issue 3, p815-856, 42p

Subject Terms: Transshipment, Algorithms, Problem solving, Undirected graphs, Wrenches

A Randomized Linear Work EREW PRAM Algorithm to Find a Minimum Spanning Forest

Authors: C. K. Poon, Vijaya Ramachandran

Contributors: The Pennsylvania State University CiteSeerX Archives

Source: ftp://ftp.cs.utexas.edu/pub/techreports/tr97-20.ps.Z

File Description: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.6270

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.6270

A linear-processor polylog-time algorithm for shortest paths in planar graphs.

Authors: Klein, P.N., Subramanian, S.

Source: Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science; 1993, p259-270, 12p

A randomized linear work EREW PRAM algorithm to find a minimum spanning forest

Authors: Chung Keung Poon, Vijaya Ramachandran

Contributors: The Pennsylvania State University CiteSeerX Archives

Source: http://www.cs.utexas.edu/~vlr/papers/mst97.pdf.

File Description: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.63.514; http://www.cs.utexas.edu/~vlr/papers/mst97.pdf

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.63.514
http://www.cs.utexas.edu/~vlr/papers/mst97.pdf