Pages that link to "Item:Q4730794"

The following pages link to A simple parallel tree contraction algorithm (Q4730794):

Displaying 39 items.

• On parallel recognition of cographs (Q627166) (← links)
• A parallel tree difference algorithm (Q673225) (← links)
• An O(\(n\)) time algorithm for maximum matching on cographs (Q685476) (← links)
• Optimal parallel quicksort on EREW PRAM (Q751287) (← links)
• On optimal parallel computations for sequences of brackets (Q808700) (← links)
• An optimal parallel algorithm forc-vertex-ranking of trees (Q834935) (← links)
• Parallel algorithms for fractional and maximal independent sets in planar graphs (Q913519) (← links)
• Parallel recognition of complement reducible graphs and cotree construction (Q919826) (← links)
• A parallel algorithm for edge-coloring of graphs with edge-disjoint cycles (Q1195493) (← links)
• Deciding whether graph \(G\) has page number one is in NC (Q1195855) (← links)
• Efficient parallel algorithms for shortest paths in planar digraphs (Q1196454) (← links)
• Parallel methods for visibility and shortest-path problems in simple polygons (Q1201749) (← links)
• Matching parentheses in parallel (Q1208458) (← links)
• Efficient parallel algorithms for r-dominating set and p-center problems on trees (Q1262780) (← links)
• More general parallel tree contraction: Register allocation and broadcasting in a tree (Q1274316) (← links)
• A linear time algorithm for the maximum matching problem on cographs (Q1314631) (← links)
• Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs (Q1317488) (← links)
• Visibility with a moving point of view (Q1322569) (← links)
• The parallel solution of domination problems on chordal and strongly chordal graphs (Q1331893) (← links)
• Parallel algorithm for finding a core of a tree network (Q1336753) (← links)
• Local consistency in parallel constraint satisfaction networks (Q1337684) (← links)
• Parallel maximum independent set in convex bipartite graphs (Q1350905) (← links)
• Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems (Q1351004) (← links)
• Parallel evaluation of arithmetic circuits (Q1365929) (← links)
• A note on parallel algorithms for optimal h-v drawings of binary trees (Q1384199) (← links)
• Parallel algorithms for the minimum cut and the minimum length tree layout problems (Q1391312) (← links)
• A time-optimal solution for the path cover problem on cographs. (Q1401176) (← links)
• Computing Prüfer codes efficiently in parallel (Q1566573) (← links)
• Efficiently parallelizable problems on a class of decomposable graphs (Q1765226) (← links)
• Optimal algorithms for the single and multiple vertex updating problems of a minimum spanning tree (Q1816995) (← links)
• Parallel preprocessing for path queries without concurrent reading. (Q1854339) (← links)
• An efficient parallel algorithm for finding rectangular duals of plane triangular graphs (Q1892581) (← links)
• Parallel tree contraction and prefix computations on a large family of interconnection topologies (Q1892710) (← links)
• An optimal parallel algorithm for planar cycle separators (Q1900892) (← links)
• Sweep methods for parallel computational geometry (Q1907233) (← links)
• An NC algorithm for finding a minimum weighted completion time schedule on series parallel graphs (Q1924401) (← links)
• Parallel approximation schemes for problems on planar graphs (Q1924999) (← links)
• Sequential and parallel algorithms on compactly represented chordal and strongly chordal graphs (Q5048948) (← links)
• Efficient parallel algorithms for some tree layout problems (Q6085718) (← links)