Pages that link to "Item:Q1321820"
From MaRDI portal
The following pages link to Maximum bounded \(H\)-matching is Max SNP-complete (Q1321820):
Displayed 13 items.
- An \(O^*(1.4366^n)\)-time exact algorithm for maximum \(P_2\)-packing in cubic graphs (Q306106) (← links)
- Matching and weighted \(P_2\)-packing: algorithms and kernels (Q393902) (← links)
- Combinatorial and computational aspects of graph packing and graph decomposition (Q458446) (← links)
- Looking at the stars (Q820158) (← links)
- An improved kernelization for \(P_{2}\)-packing (Q991748) (← links)
- Vertex and edge covers with clustering properties: Complexity and algorithms (Q1026225) (← links)
- A \((3+\epsilon)k\)-vertex kernel for edge-disjoint triangle packing (Q1628680) (← links)
- A \(5k\)-vertex kernel for \(P_2\)-packing (Q2118855) (← links)
- The minimum degree threshold for perfect graph packings (Q2149489) (← links)
- The complexity of perfect matchings and packings in dense hypergraphs (Q2284737) (← links)
- On ring grooming in optical networks (Q2385478) (← links)
- The Complexity of Perfect Packings in Dense Graphs (Q2988829) (← links)
- Improved Algorithms for Several Parameterized Problems Based on Random Methods (Q4632170) (← links)