Pages that link to "Item:Q405671"

The following pages link to An exact algorithm for the maximum probabilistic clique problem (Q405671):

Displaying 3 items.

• On risk-averse maximum weighted subgraph problems (Q405680) (← links)
• Detecting robust cliques in graphs subject to uncertain edge failures (Q1640046) (← links)
• New restrictions on defective coloring with applications to Steinberg-type graphs (Q2185826) (← links)