scientific article; zbMATH DE number 4060743

MaRDI QIDQ3795246zbMATH OpenFDO

Authors Vijaya Ramachandran, Uzi Vishkin

Publication date 1988

zbMATH Keywords

efficient parallel algorithmsGauss codesHamiltonian cycleplanarity of graphstriconnectivity testing

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to combinatorics (05-04) Connectivity (05C40) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A new graph triconnectivity algorithm and its parallelization
• Finding Triconnected Components by Local Replacement
• An Efficient Parallel Biconnectivity Algorithm
• scientific article; zbMATH DE number 4168710
• A parallel algorithm for finding a triconnected component separator with an application

Cited in

(7)

• Randomized range-maxima in nearly-constant parallel time
• Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs
• Planarity testing in parallel
• Finding Triconnected Components by Local Replacement
• Triply-logarithmic upper and lower bounds for minimum, range minima, and related problems with integer inputs
• Quantum data structure for range minimum query
• Improved algorithms for graph four-connectivity

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3795246)