Pages that link to "Item:Q2988829"
From MaRDI portal
The following pages link to The Complexity of Perfect Packings in Dense Graphs (Q2988829):
Displaying 10 items.
- Integer and fractional packings in dense graphs (Q873647) (← links)
- On the complexity of digraph packings (Q1007581) (← links)
- The complexity of generalized clique packing (Q1073049) (← links)
- The complexity of perfect matchings and packings in dense hypergraphs (Q2284737) (← links)
- The computational complexity of the edge-perfect graph and the totally balanced packing game recognition problems (Q2883612) (← links)
- Denser packings obtained in \(O(n \log \log n)\) time (Q2892352) (← links)
- (Q3139770) (← links)
- (Q4222171) (← links)
- On Perfect Matchings and Tilings in Uniform Hypergraphs (Q4638614) (← links)
- The impact of the growth rate of the packing number of graphs on the computational complexity of the independent set problem (Q5249786) (← links)