Pages that link to "Item:Q1115630"
From MaRDI portal
The following pages link to Subtree isomorphism is NC reducible to bipartite perfect matching (Q1115630):
Displayed 13 items.
- Subtree isomorphism is in random NC (Q922707) (← links)
- Approximate labelled subtree homeomorphism (Q1018101) (← links)
- Subtree isomorphism is NC reducible to bipartite perfect matching (Q1115630) (← links)
- Perfect matching for regular graphs is \(AC^ 0\)-hard for the general matching problem (Q1185245) (← links)
- Tight complexity bounds for term matching problems (Q1201724) (← links)
- Maximum tree-packing in time \(O(n^{5/2})\) (Q1391314) (← links)
- Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time (Q1978642) (← links)
- Bipartite Perfect Matching is in Quasi-NC (Q4997314) (← links)
- Sequential and parallel algorithms for embedding problems on classes of partial k-trees (Q5054759) (← links)
- Some complexity theoretic aspects of AC rewriting (Q5096174) (← links)
- The parallel complexity of tree embedding problems (extended abstract) (Q5096766) (← links)
- Derandomizing Isolation in Space-Bounded Settings (Q5232318) (← links)
- Maximum tree-packing in time O(n5/2) (Q6085700) (← links)