Pages that link to "Item:Q922700"

The following pages link to Maximum bounded 3-dimensional matching is MAX SNP-complete (Q922700):

Displaying 5 items.

• Mixed hypergraphs with bounded degree: Edge-coloring of mixed multigraphs. (Q1401245) (← links)
• Some APX-completeness results for cubic graphs (Q1566710) (← links)
• TRACTABLE AND INTRACTABLE VARIATIONS OF UNORDERED TREE EDIT DISTANCE (Q2929619) (← links)
• APPROXIMATING THE MAXIMUM ISOMORPHIC AGREEMENT SUBTREE IS HARD (Q4528764) (← links)
• On approximation properties of the Independent set problem for degree 3 graphs (Q5057456) (← links)