Pages that link to "Item:Q5144801"
From MaRDI portal
The following pages link to Why Is Maximum Clique Often Easy in Practice? (Q5144801):
Displaying 11 items.
- Worst-case analysis of clique MIPs (Q2089781) (← links)
- A matheuristic for a customer assignment problem in direct marketing (Q2171614) (← links)
- On Fault-Tolerant Low-Diameter Clusters in Graphs (Q5060794) (← links)
- Influence Maximization with Latency Requirements on Social Networks (Q5085986) (← links)
- Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem (Q5087709) (← links)
- A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem (Q5867624) (← links)
- On atomic cliques in temporal graphs (Q6043101) (← links)
- Research trends in combinatorial optimization (Q6091419) (← links)
- Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations (Q6102859) (← links)
- A polytime preprocess algorithm for the maximum independent set problem (Q6151535) (← links)
- CliSAT: a new exact algorithm for hard maximum clique problems (Q6167321) (← links)