Pages that link to "Item:Q479213"

The following pages link to Solving maximum clique in sparse graphs: an \({O(nm+n2^{d/4})}\) algorithm for \(d\)-degenerate graphs (Q479213):

Displaying 5 items.

• General results on preferential attachment and clustering coefficient (Q526411) (← links)
• A new decomposition technique for maximal clique enumeration for sparse graphs (Q1740688) (← links)
• Worst-case analysis of clique MIPs (Q2089781) (← links)
• Why Is Maximum Clique Often Easy in Practice? (Q5144801) (← links)
• A polytime preprocess algorithm for the maximum independent set problem (Q6151535) (← links)