Pages that link to "Item:Q1098641"
From MaRDI portal
The following pages link to Parallelism and the maximal path problem (Q1098641):
Displayed 11 items.
- The lexicographically first topological order problem is NLOG-complete (Q582104) (← links)
- Using maximal independent sets to solve problems in parallel (Q672378) (← links)
- A parallel algorithm for the maximal path problem (Q1100916) (← links)
- \(\Delta{} ^ p_ 2\)-complete lexicographically first maximal subgraph problems (Q1177173) (← links)
- The computational complexity of pattern formation (Q1279214) (← links)
- Frameworks for designing in-place graph algorithms (Q2237887) (← links)
- On parallelizing a greedy heuristic for finding small dominant sets (Q2366651) (← links)
- Depth-First Search Using $$O(n)$$ Bits (Q2942660) (← links)
- Probabilistic analysis of a parallel algorithm for finding the lexicographically first depth first search tree in a dense random graph (Q3357536) (← links)
- The lexicographically first maximal subgraph problems:P-completeness andNC algorithms (Q4729355) (← links)
- A Framework for In-place Graph Algorithms (Q5009570) (← links)