scientific article; zbMATH DE number 3576688
From MaRDI portal
Publication:4146249
zbMath0369.68022MaRDI QIDQ4146249
Publication date: 1976
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Algorithms in computer science (68W99)
Related Items (10)
A new class of parallel algorithms for finding connected components on machines with bit-vector operations ⋮ On the parallel computation of the biconnected and strongly connected co-components of graphs ⋮ Determining connected components in linear time by a linear number of processors ⋮ Parallelism and the feedback vertex set problem ⋮ Parallel computation and conflicts in memory access ⋮ Efficient parallel algorithms for path problems in directed graphs ⋮ Parallel strong orientation of an undirected graph ⋮ An optimal parallel connectivity algorithm ⋮ On the Strongly Connected and Biconnected Components of the Complement of Graphs ⋮ Near-optimal scheduling in the congested clique
This page was built for publication:
