×

Found 10 Documents (Results 1–10)

An optimal parallel algorithm for minimum spanning trees in planar graphs. (English) Zbl 1331.68283

Zaroliagis, Christos (ed.) et al., Algorithms, probability, networks, and games. Scientific papers and essays dedicated to Paul G. Spirakis on the occasion of his 60th birthday. Cham: Springer (ISBN 978-3-319-24023-7/pbk; 978-3-319-24024-4/ebook). Lecture Notes in Computer Science 9295, 169-182 (2015).
MSC:  68W10 05C85 68R10
PDFBibTeX XMLCite
Full Text: DOI

On the parallel time complexity of undirected connectivity and minimum spanning trees. (English) Zbl 0938.68145

Proceedings of the 10th annual ACM-SIAM symposium on discrete algorithms. Baltimore, MD, USA, January 17-19, 1999. Philadelphia, PA: SIAM. 225-234 (1999).
PDFBibTeX XMLCite

Improving biconnectivity approximation via local optimization. (English) Zbl 0847.68076

Proceedings of the 7th annual ACM-SIAM symposium on discrete algorithms, held in Atlanta, GA, USA, January 28-30, 1996. Philadelphia, PA: SIAM. 26-35 (1996).
MSC:  68R10 68W10 68Q25
PDFBibTeX XMLCite

Towards more precise parallel biconnectivity approximation. (English) Zbl 1512.68204

Asano, Tetsuo (ed.) et al., Algorithms and computation. 7th international symposium, ISAAC ’96, Osaka, Japan, December 16–18, 1996. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1178, 223-232 (1996).
PDFBibTeX XMLCite
Full Text: DOI

Finding connected components in \(O(\log n\log\log n)\) time on the EREW PRAM. (English) Zbl 0801.68123

Ramachandran, Vijaya (ed.), Discrete algorithms. Proceedings of the 4th annual ACM-SIAM symposium, held at Austin, TX, USA, January 25-27, 1993. Philadelphia, PA: SIAM. 11-20 (1993).
MSC:  68R10 68Q25 68W15
PDFBibTeX XMLCite

Filter Results by …

Document Type

all top 5

Year of Publication

Main Field