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 Computer science foundations Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on. :259-270 1993

Relation: Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science

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

Authors: Philip N. Klein, Sairam Subramaniany

Contributors: The Pennsylvania State University CiteSeerX Archives

Source: http://www.cs.brown.edu/people/pnk/publications/1993parPlanarShort.ps.

File Description: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.67.6410; http://www.cs.brown.edu/people/pnk/publications/1993parPlanarShort.ps

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.67.6410
http://www.cs.brown.edu/people/pnk/publications/1993parPlanarShort.ps

Deciding whether graph G has page number one is in NC: Deciding whether graph \(G\) has page number one is in NC

Authors: Shigeru Masuyama, Shozo Naito

Source: Information Processing Letters. 44:7-10

Subject Terms: class NC, page number one, Analysis of algorithms and problem complexity, Graph theory (including graph drawing) in computer science, 4. Education, parallel graph algorithm, Distributed algorithms, 0102 computer and information sciences, forbidden subgraph, 01 natural sciences, 7. Clean energy, polylog time algorithm

File Description: application/xml

Access URL: http://www.kurims.kyoto-u.ac.jp/~kyodo/kokyuroku/contents/pdf/0790-22.pdf

Efficient parallel solution of linear systems

Authors: Pan, V, Reif, J

Source: Proceedings of the seventeenth annual ACM symposium on Theory of computing. :143-152

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

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

Distributed backup placement in networks.

Authors: Halldórsson, Magnús M., Köhler, Sven, Patt-Shamir, Boaz, Rawitz, Dror

Source: Distributed Computing; Apr2018, Vol. 31 Issue 2, p83-98, 16p

Subject Terms: Data protection, Back up systems, Wireless localization, Distributed computing, Geographical positions

Online Pattern Matching for String Edit Distance with Moves.

Authors: Takabatake, Yoshimasa, Tabei, Yasuo, Sakamoto, Hiroshi

Source: String Processing & Information Retrieval: 21st International Symposium, SPIRE 2014, Ouro Preto, Brazil, October 20-22, 2014. Proceedings; 2014, p203-214, 12p

Estimating the size of the transitive closure in linear time.

Authors: Cohen, E.

Source: Proceedings 35th Annual Symposium on Foundations of Computer Science; 1994, p190-200, 11p

Efficient matrix chain ordering in polylog time.

Authors: Bradford, P.G., Rawlins, G.J.E., Shannon, G.E.

Source: Proceedings of 8th International Parallel Processing Symposium; 1994, p234-241, 8p

A unified approach to dynamic point location, ray shooting, and shortest paths in planar maps.

Authors: Chiang, Yi-Jen, Preparata, Franco P., Tamassia, Roberto

Source: Proceedings of the Fourth Annual ACM-SIAM Symposium: Discrete Algorithms; 1/1/1993, p44-53, 10p

Local-Global Phenomena in Graphs.

Source: Combinatorics, Geometry & Probability; 1997, p449-462, 14p

Polynomially Improved Efficiency for Fast Parallel Single-Source Lexicographic Depth-First Search, Breadth-First Search, and Topological-First Search.

Authors: de la Torre, P., Kruskal, C. P.

Source: Theory of Computing Systems; Jul/Aug2001, Vol. 34 Issue 4, p275, 24p

Subject Terms: Parallel algorithms, Search theory, Topology

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 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

Bounded Length UCFG Equivalence

Authors: B. Litow

Contributors: The Pennsylvania State University CiteSeerX Archives

Source: http://www.cs.jcu.edu.au/ftp/pub/techreports/96-2.ps.gz.

File Description: application/postscript

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

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.9665
http://www.cs.jcu.edu.au/ftp/pub/techreports/96-2.ps.gz

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

Efficient Matrix Chain Ordering in Polylog Time

Authors: Bradford, Phillip G., Rawlins, Gregory J. E., Shannon, Gregory E.

Source: SIAM Journal on Computing; 1998, Vol. 27 Issue 2, p466, 25p

Local-Global Phenomena in Graphs.

Authors: Linial, Nathan

Source: Combinatorics, Probability & Computing; Oct1993, Vol. 2 Issue 4, p491-503, 13p

A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs.

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

Source: Algorithmica; Nov1998, Vol. 22 Issue 3, p235-249, 15p