Pages that link to "Item:Q3904540"
From MaRDI portal
The following pages link to A fast parallel algorithm for routing in permutation networks (Q3904540):
Displaying 28 items.
- Parallel random access machines with bounded memory wordsize (Q757038) (← links)
- A parallel-design distributed-implementation (PDDI) general-purpose computer (Q797283) (← links)
- Improved edge-coloring with three colors (Q837164) (← links)
- Optimally edge-colouring outerplanar graphs is in NC (Q909461) (← links)
- Counterexample to a conjecture of Szymanski on hypercube routing (Q911780) (← links)
- A complexity theory of efficient parallel algorithms (Q913512) (← links)
- On permutations of wires and states (Q1064313) (← links)
- Routing, merging, and sorting on parallel models of computation (Q1082818) (← links)
- Parallel O(log n) time edge-colouring of trees and Halin graphs (Q1107328) (← links)
- Parallel construction of perfect matchings and Hamiltonian cycles on dense graphs (Q1116690) (← links)
- Perfect matching for regular graphs is \(AC^ 0\)-hard for the general matching problem (Q1185245) (← links)
- A parallel algorithm for approximating the minimum cycle cover (Q1207326) (← links)
- Approximating matchings in parallel (Q1261482) (← links)
- Decompositions to degree-constrained subgraphs are simply reducible to edge-colorings (Q1305535) (← links)
- Restricted CRCW PRAMs (Q1314395) (← links)
- The probabilistic method yields deterministic parallel algorithms (Q1342858) (← links)
- Minimum multiplicity edge coloring via orientation (Q1671364) (← links)
- The local nature of \(\Delta\)-coloring and its algorithmic applications (Q1894705) (← links)
- On the Parameterized Parallel Complexity and the Vertex Cover Problem (Q2958339) (← links)
- The generalized folding-cube network (Q3204022) (← links)
- Some Graph-Colouring Theorems with Applications to Generalized Connection Networks (Q3689205) (← links)
- Parallel algorithms for routing in nonblocking networks (Q4277375) (← links)
- Applications of matching and edge‐coloring algorithms to routing in clos networks (Q4313624) (← links)
- Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases (Q4508634) (← links)
- Multicommodity flows in simple multistage networks (Q4698226) (← links)
- Solving fundamental problems on sparse-meshes (Q5054864) (← links)
- Asymmetrical multiconnection three‐stage clos networks (Q5289385) (← links)
- Off‐line permutation routing on circuit‐switched fixed‐routing networks (Q5289386) (← links)