Pages that link to "Item:Q1095666"

The following pages link to Parallel ear decomposition search (EDS) and st-numbering in graphs (Q1095666):

Displaying 21 items.

• Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms (Q758188) (← links)
• Successive approximation in parallel graph algorithms (Q914386) (← links)
• Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm (Q919827) (← links)
• Algorithms for computing a parameterized \(st\)-orientation (Q959815) (← links)
• Optimal \(st\)-orientations for plane triangulations (Q1029266) (← links)
• A new graph triconnectivity algorithm and its parallelization (Q1193533) (← links)
• Parallel search algorithms for graphs and trees (Q1204800) (← links)
• Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs (Q1317488) (← links)
• Planarity testing in parallel (Q1342859) (← 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)
• Simple computation of \textit{st}-edge- and \textit{st}-numberings from ear decompositions (Q1730030) (← links)
• Balanced vertex-orderings of graphs (Q1775059) (← links)
• Bipolar orientations revisited (Q1842650) (← links)
• The complexity of planarity testing (Q1887150) (← links)
• Data-Oblivious Graph Algorithms in Outsourced External Memory (Q2942400) (← links)
• Design and Engineering of External Memory Traversal Algorithms for General Graphs (Q3637309) (← links)
• Efficient parallel graph algorithms for coarse grained multicomputers and BSP (Q4571970) (← links)
• Successive approximation in parallel graph algorithms (Q5096155) (← links)
• Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems (Q5096905) (← links)