Pages that link to "Item:Q1185245"
From MaRDI portal
The following pages link to Perfect matching for regular graphs is \(AC^ 0\)-hard for the general matching problem (Q1185245):
Displayed 4 items.
- Parallel construction of perfect matchings and Hamiltonian cycles on dense graphs (Q1116690) (← links)
- Approximating the permanent of graphs with large factors (Q1199692) (← links)
- The computational complexity of graph problems with succinct multigraph representation (Q3801600) (← links)
- Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases (Q4508634) (← links)