Pages that link to "Item:Q3075512"

The following pages link to GreedyMAX-type Algorithms for the Maximum Independent Set Problem (Q3075512):

Displaying 12 items.

• GreedyMAX (Q14603) (← links)
• It is hard to know when greedy is good for finding independent sets (Q286978) (← links)
• The \textsc{max quasi-independent set} problem (Q434194) (← links)
• Forbidden subgraphs implying the MIN-algorithm gives a maximum independent set (Q1849924) (← links)
• A note on greedy algorithms for the maximum weighted independent set problem (Q1861582) (← links)
• New potential functions for greedy independence and coloring (Q2255044) (← links)
• Partitions of graphs into small and large sets (Q2446835) (← links)
• Exact Algorithms for Maximum Independent Set (Q2872097) (← links)
• (Q3479822) (← links)
• The potential of greed for independence (Q4650180) (← links)
• A priori optimization for the probabilistic maximum independent set problem (Q5958320) (← links)
• Targeted Branching for the Maximum Independent Set Problem (Q6159907) (← links)