Pages that link to "Item:Q3985812"
From MaRDI portal
The following pages link to Parallel Tree Contraction Part 2: Further Applications (Q3985812):
Displaying 17 items.
- Approximation of smallest linear tree grammar (Q342719) (← links)
- The parallel complexity of graph canonization under abelian group action (Q378219) (← links)
- Randomized parallel list ranking for distributed memory multiprocessors. (Q676261) (← links)
- The isomorphism problem for \(k\)-trees is complete for logspace (Q714733) (← links)
- Subtree isomorphism is in random NC (Q922707) (← links)
- More general parallel tree contraction: Register allocation and broadcasting in a tree (Q1274316) (← links)
- Planarity testing in parallel (Q1342859) (← links)
- Completeness results for graph isomorphism. (Q1401960) (← links)
- An optimal parallel algorithm for planar cycle separators (Q1900892) (← links)
- The isomorphism problem for planar 3-connected graphs is in unambiguous logspace (Q1959391) (← links)
- A \(c^k n\) 5-approximation algorithm for treewidth (Q2799353) (← links)
- The Isomorphism Problem for k-Trees Is Complete for Logspace (Q3182953) (← links)
- From Invariants to Canonization in Parallel (Q3503640) (← links)
- AN EFFICIENT EREW ALGORITHM FOR MINIMUM PATH COVER AND HAMILTONICITY ON COGRAPHS (Q4819984) (← links)
- (Q5874462) (← links)
- More general parallel tree contraction: register allocation and broadcasting in a tree (Q6550540) (← links)
- Randomized parallel list ranking for distributed memory multiprocesors (Q6560349) (← links)
