Pages that link to "Item:Q3694710"
From MaRDI portal
The following pages link to An Efficient Parallel Biconnectivity Algorithm (Q3694710):
Displaying 50 items.
- Parallel search algorithms for graphs and trees (Q1204800) (← links)
- An optimal parallel algorithm for computing furthest neighbors in a tree (Q1205722) (← links)
- Efficient parallel algorithms for r-dominating set and p-center problems on trees (Q1262780) (← links)
- A parallel algorithm for finding a blocking flow in an acyclic network (Q1263969) (← links)
- Optimal parallel algorithms on circular-arc graphs (Q1263980) (← links)
- Sorting in linear time? (Q1273863) (← links)
- More general parallel tree contraction: Register allocation and broadcasting in a tree (Q1274316) (← links)
- On testing consecutive-ones property in parallel (Q1281757) (← links)
- Parallel construction and query of index data structures for pattern matching on square matrices (Q1288531) (← links)
- Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs (Q1317488) (← links)
- Recognition algorithm for intersection graphs of edge disjoint paths in a tree (Q1318763) (← links)
- Two-coloring linked lists is NC\(^ 1\)-complete for logarithmic space (Q1318772) (← links)
- New algorithms for the LCA problem and the binary tree reconstruction problem (Q1328757) (← links)
- Finding level-ancestors in trees (Q1329158) (← links)
- An efficient parallel algorithm for the single function coarsest partition problem (Q1329732) (← 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)
- Data structures for two-edge connectivity in planar graphs (Q1331953) (← links)
- A parallel algorithm for finding a triconnected component separator with an application (Q1339375) (← links)
- An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph (Q1341730) (← links)
- Planarity testing in parallel (Q1342859) (← links)
- Efficient parallel recognition algorithms of cographs and distance hereditary graphs (Q1345961) (← links)
- Connected components in \(O(\log^{3/2}n)\) parallel time for the CREW PRAM (Q1356881) (← links)
- Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm (Q1373746) (← links)
- A remark on maximum matching of line graphs (Q1377734) (← links)
- An optimal parallel algorithm for digital curve segmentation (Q1391535) (← links)
- A time-optimal solution for the path cover problem on cographs. (Q1401176) (← links)
- Computing Prüfer codes efficiently in parallel (Q1566573) (← links)
- Concurrent vs. exclusive reading in parallel decoding of LZ-compressed files (Q1662611) (← links)
- Optimal algorithms for the single and multiple vertex updating problems of a minimum spanning tree (Q1816995) (← links)
- Solving some combinatorial problems on arrays with one-way dataflow (Q1825042) (← links)
- Faster optimal parallel prefix sums and list ranking (Q1825647) (← links)
- Parallel preprocessing for path queries without concurrent reading. (Q1854339) (← links)
- Improving the efficiency of parallel minimum spanning tree algorithms (Q1861567) (← links)
- An efficient distributed bridge-finding algorithm (Q1894245) (← links)
- Optimal parallel algorithms for rectilinear link-distance problems (Q1897477) (← links)
- Sweep methods for parallel computational geometry (Q1907233) (← links)
- Optimal computation of shortest paths on doubly convex bipartite graphs (Q1963107) (← links)
- Efficient algorithms for acyclic colorings of graphs (Q1978502) (← links)
- Optimal parallel algorithms for multiple updates of minimum spanning trees (Q2366226) (← links)
- Selecting distances in the plane (Q2366232) (← links)
- On the parallel computation of the biconnected and strongly connected co-components of graphs (Q2383544) (← links)
- A 2-approximation NC algorithm for connected vertex cover and tree cover (Q2390219) (← links)
- Priority functions for the approximation of the metric TSP (Q2444775) (← links)
- The Monotone Circuit Value Problem with Bounded Genus Is in NC (Q2817851) (← links)
- Data-Oblivious Graph Algorithms in Outsourced External Memory (Q2942400) (← links)
- SOLVING THE TRAVELING SALESMAN PROBLEM USING EFFICIENT RANDOMIZED PARALLEL APPROXIMATION ALGORITHMS (Q3130161) (← links)
- Optimal parallel colouring algorithms for totally decomposable graphs (Q4323714) (← links)
- An optimal parallel algorithm for computing cut vertices and blocks on interval graphs (Q4498117) (← links)
- Efficient parallel graph algorithms for coarse grained multicomputers and BSP (Q4571970) (← links)
