Pages that link to "Item:Q1892868"
From MaRDI portal
The following pages link to Efficient parallel algorithms for permutation graphs (Q1892868):
Displaying 18 items.
- An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs (Q290218) (← links)
- An efficient parallel algorithm for building the separating tree (Q666141) (← links)
- An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs (Q671937) (← links)
- Solving the shortest-paths problem on bipartite permutation graphs efficiently (Q672656) (← links)
- Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs (Q1313714) (← links)
- Parallel algorithms for permutation graphs (Q1314630) (← links)
- A heuristic to accelerate in-situ permutation algorithms (Q1603509) (← links)
- Coloring permutation graphs in parallel (Q1613373) (← links)
- Parallel algorithms for separable permutations (Q1763485) (← links)
- Weighted independent perfect domination on cocomparability graphs (Q1917231) (← links)
- Coloring permutation graphs in parallel (Q2741358) (← links)
- (Q3513420) (← links)
- (Q3738573) (← links)
- (Q3785968) (← links)
- (Q4222504) (← links)
- Some Efficient Algorithms for Permutation Graphs (Q4290917) (← links)
- Optimal Sequential And Parallel Algorithms To Compute A Steiner Tree On Permutation Graphs (Q4454318) (← links)
- A permutation parallel algorithm under exchange restriction with message passing interface (Q6051699) (← links)