Pages that link to "Item:Q3957960"

The following pages link to An O(logn) parallel connectivity algorithm (Q3957960):

Displaying 50 items.

• Adapting parallel algorithms to the W-stream model, with applications to graph problems (Q410728) (← links)
• Optimal parallel algorithms on planar graphs (Q582094) (← links)
• Efficient parallel algorithms for doubly convex-bipartite graphs (Q672468) (← links)
• 1-Approximation algorithm for bottleneck disjoint path matching (Q672495) (← links)
• Resource bounds for parallel computation of threshold and symmetric functions (Q751804) (← links)
• Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms (Q758188) (← links)
• A parallel-design distributed-implementation (PDDI) general-purpose computer (Q797283) (← links)
• An optimal parallel connectivity algorithm (Q797997) (← links)
• Finding Euler tours in parallel (Q801686) (← links)
• Incomplete directed perfect phylogeny in linear time (Q832858) (← links)
• A parallel algorithm for eliminating cycles in undirected graphs (Q910243) (← links)
• Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs (Q911763) (← links)
• A complexity theory of efficient parallel algorithms (Q913512) (← links)
• Successive approximation in parallel graph algorithms (Q914386) (← links)
• An efficient algorithm for edge coloring planar graphs with \(\Delta\) colors (Q914387) (← links)
• Incomparability in parallel computation (Q919822) (← links)
• On efficient parallel strong orientation (Q1082819) (← links)
• A parallel algorithm for the monadic unification problem (Q1083189) (← links)
• Finding small simple cycle separators for 2-connected planar graphs (Q1085169) (← links)
• Parallel ear decomposition search (EDS) and st-numbering in graphs (Q1095666) (← links)
• Separation and lower bounds for ROM and nondeterministic models of parallel computation (Q1098633) (← links)
• Communication-efficient parallel algorithms for distributed random-access machines (Q1104096) (← links)
• Chordal graph recognition is in NC (Q1108003) (← links)
• A nearly optimal parallel algorithm for constructing maximal independent set in planar graphs (Q1109576) (← links)
• Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs (Q1111390) (← links)
• Parallel computational geometry (Q1115600) (← links)
• Parallel construction of perfect matchings and Hamiltonian cycles on dense graphs (Q1116690) (← links)
• A linear systolic algorithm for the connected component problem (Q1123585) (← links)
• A parallel algorithm for the maximum 2-chain edge packing problem (Q1123636) (← links)
• Processor-time optimal parallel algorithms for digitized images on mesh- connected processor arrays (Q1175647) (← links)
• Efficient parallel algorithms to test square-freeness and factorize strings (Q1178198) (← links)
• Processor-time tradeoffs in PRAM simulations (Q1185246) (← links)
• Data reduction and fast routing: A strategy for efficient algorithms for message-passing parallel computers (Q1187201) (← links)
• Counting clique trees and computing perfect elimination schemes in parallel (Q1262131) (← links)
• On parallel complexity of the subgraph homeomorphism of the subgraph isomorphism problem for classes of planar graphs (Q1262768) (← links)
• Vectorized search for single clusters (Q1279226) (← links)
• Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs (Q1317488) (← links)
• Static and dynamic parallel computation of connected components (Q1322111) (← links)
• A new class of parallel algorithms for finding connected components on machines with bit-vector operations (Q1328526) (← links)
• A parallel algorithm for computing Steiner trees in strongly chordal graphs (Q1329803) (← links)
• The parallel solution of domination problems on chordal and strongly chordal graphs (Q1331893) (← links)
• An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph (Q1341730) (← links)
• Efficient parallel recognition algorithms of cographs and distance hereditary graphs (Q1345961) (← links)
• Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems (Q1351004) (← links)
• Connected components in \(O(\log^{3/2}n)\) parallel time for the CREW PRAM (Q1356881) (← links)
• A remark on maximum matching of line graphs (Q1377734) (← links)
• Monte Carlo circuits for the abelian permutation group intersection problem (Q1820579) (← links)
• \(O(\log \log n)\)-time integer geometry on the CRCW PRAM (Q1894712) (← links)
• Sweep methods for parallel computational geometry (Q1907233) (← links)
• A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms (Q1917270) (← links)