Pages that link to "Item:Q1111392"

The following pages link to An improved parallel algorithm that computes the BFS numbering of a directed graph (Q1111392):

Displaying 16 items.

• Efficient parallel algorithms for computing all pair shortest paths in directed graphs (Q676269) (← links)
• A parallel algorithm for finding a maximum clique of a set of circular arcs of a circle (Q911283) (← links)
• A randomized NC algorithm for the maximal tree cover problem (Q1183479) (← links)
• Efficient parallel algorithms for path problems in directed graphs (Q1186791) (← links)
• A model classifying algorithms as inherently sequential with applications to graph searching (Q1187028) (← links)
• A fast and efficient parallel algorithm for finding a satisfying truth assignment to a 2-CNF formula (Q1199880) (← links)
• Parallel search algorithms for graphs and trees (Q1204800) (← links)
• Improved processor bounds for parallel algorithms for weighted directed graphs (Q1209343) (← links)
• An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph (Q1341730) (← links)
• Tiling pictures of the plane with dominoes (Q1356753) (← links)
• Tiling of planar figures without gaps by dominos: graphical foundations of Thurston if algorithm, parallelization uniqueness and decomposion (Q1366534) (← links)
• An efficient parallel algorithm for finding rectangular duals of plane triangular graphs (Q1892581) (← 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)
• Arithmetic in finite fields based on the Chudnovsky-Chudnovsky multiplication algorithm (Q5270844) (← links)
• Finding smallest supertrees (Q6487952) (← links)