Pages that link to "Item:Q4521526"

The following pages link to Complexity of Recognizing Equal Unions in Families of Sets (Q4521526):

Displaying 11 items.

• Approximating maximum edge 2-coloring in simple graphs (Q608271) (← links)
• On the algebraic complexity of set equality and inclusion (Q834932) (← links)
• An improved approximation algorithm for maximum edge 2-coloring in simple graphs (Q935838) (← links)
• On the complexity of recognizing directed path families (Q967290) (← links)
• Approximating maximum edge 2-coloring in simple graphs via local improvement (Q1035687) (← links)
• Union-freeness, deterministic union-freeness and union-complexity (Q2179325) (← links)
• Polynomial recognition of equal unions in hypergraphs with few vertices of large degree (Q2458923) (← links)
• Packing \([1, \Delta ]\)-factors in graphs of small degree (Q2460103) (← links)
• Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement (Q3511418) (← links)
• (Q3785940) (← links)
• A note on equal unions in families of sets (Q5951949) (← links)