Highly Influenced

# Maximum Bounded H-Matching is MAX SNP-Complete

@article{Kann1994MaximumBH, title={Maximum Bounded H-Matching is MAX SNP-Complete}, author={Viggo Kann}, journal={Inf. Process. Lett.}, year={1994}, volume={49}, pages={309-318} }

- Published 1994 in Inf. Process. Lett.
DOI:10.1016/0020-0190(94)90105-8

We prove that maximum H-matching (the problem of determining the maximum number of node-disjoint copies of the fixed graph H contained in a variable graph) is a MAX SNP-hard problem for any graph H that has three or more nodes in some connected component. If H is connected and the degrees of the nodes in H are bounded by a constant the problem is MAX SNP-complete.Â

Highly Cited

This paper has 42 citations. REVIEW CITATIONS

#### From This Paper

##### Figures, tables, and topics from this paper.

#### Citations

##### Publications citing this paper.

#### References

##### Publications referenced by this paper.

Showing 1-6 of 6 references