Pages that link to "Item:Q2942692"

The following pages link to Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks (Q2942692):

Displaying 21 items.

• On robust clusters of minimum cardinality in networks (Q513606) (← links)
• New heuristic approaches for maximum balanced biclique problem (Q781924) (← links)
• Detecting robust cliques in graphs subject to uncertain edge failures (Q1640046) (← links)
• Frequency-driven tabu search for the maximum \(s\)-plex problem (Q1652378) (← links)
• Tackling the maximum happy vertices problem in large networks (Q2026712) (← links)
• Worst-case analysis of clique MIPs (Q2089781) (← links)
• Parsimonious formulations for low-diameter clusters (Q2220903) (← links)
• On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs (Q2242194) (← links)
• Graph signatures: identification and optimization (Q2242325) (← links)
• On the maximum small-world subgraph problem (Q2327623) (← links)
• Scale reduction techniques for computing maximum induced bicliques (Q2633172) (← links)
• On CLIQUE Problem for Sparse Graphs of Large Dimension (Q3463541) (← 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)
• Bounds and algorithms for graph trusses (Q5119376) (← links)
• Constraint and Satisfiability Reasoning for Graph Coloring (Q5129999) (← links)
• Why Is Maximum Clique Often Easy in Practice? (Q5144801) (← links)
• A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs (Q5154765) (← links)
• An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs (Q6065850) (← links)
• SAT-boosted tabu search for coloring massive graphs (Q6579769) (← links)
• Finding conserved low-diameter subgraphs in social and biological networks (Q6659091) (← links)