The following pages link to (Q3145799):
Displaying 50 items.
- A review on algorithms for maximum clique problems (Q2630214) (← links)
- Finding disjoint dense clubs in a social network (Q2636493) (← links)
- Copositivity cuts for improving SDP bounds on the clique number (Q2638373) (← links)
- Extended and discretized formulations for the maximum clique problem (Q2655650) (← links)
- QUBO formulations of the longest path problem (Q2658047) (← links)
- Generating irreducible copositive matrices using the stable set problem (Q2664002) (← links)
- The stable set problem: clique and nodal inequalities revisited (Q2664356) (← links)
- Solving longest common subsequence problems via a transformation to the maximum clique problem (Q2664444) (← links)
- Approximating maximum diameter-bounded subgraph in unit disk graphs (Q2665266) (← links)
- Drainage area maximization in unconventional hydrocarbon fields with integer linear programming techniques (Q2675702) (← links)
- A characterization of the weighted version of McEliece-Rodemich-Rumsey-Schrijver number based on convex quadratic programming (Q2788727) (← links)
- Distance-Based Clique Relaxations in Networks: s-Clique and s-Club (Q2820114) (← links)
- Optimal monotone relabelling of partially non-monotone ordinal data (Q2885460) (← links)
- On the 2-Club Polytope of Graphs (Q2957469) (← links)
- Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications (Q2980894) (← links)
- Subgroup growth of right‐angled Artin and Coxeter groups (Q3296747) (← links)
- Equilibrium Distributions of Populations of Biological Species on Networks of Social Sites (Q3304326) (← links)
- A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem (Q3386795) (← links)
- An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph (Q3386796) (← links)
- Parallel Maximum Clique Algorithms with Applications to Network Analysis (Q3447472) (← links)
- Orbital Independence in Symmetric Mathematical Programs (Q3467864) (← links)
- On Importance of a Special Sorting in the Maximum-Weight Clique Algorithm Based on Colour Classes (Q3627689) (← links)
- An Extended Comparison of the Best Known Algorithms for Finding the Unweighted Maximum Clique (Q3627690) (← links)
- Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms (Q3627718) (← links)
- Word-Representable Graphs: a Survey (Q4558287) (← links)
- The Distribution of Minimum-Weight Cliques and Other Subgraphs in Graphs with Random Edge Weights (Q4581213) (← links)
- A Multigrid Approach to SDP Relaxations of Sparse Polynomial Optimization Problems (Q4600837) (← links)
- A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique (Q4632188) (← links)
- Finding Disjoint Dense Clubs in an Undirected Graph (Q4632197) (← links)
- New Lower Bounds for Binary Constant-Dimension Subspace Codes (Q4643732) (← links)
- Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection (Q4985798) (← links)
- Complexity and Polynomially Solvable Special Cases of QUBO (Q5050143) (← links)
- Fast Cluster Detection in Networks by First Order Optimization (Q5065475) (← links)
- Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph (Q5072588) (← links)
- A General Regularized Continuous Formulation for the Maximum Clique Problem (Q5108235) (← links)
- Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs (Q5115768) (← links)
- On the Approximability of the Minimum Weight $t$-partite Clique Problem (Q5119375) (← links)
- Why Is Maximum Clique Often Easy in Practice? (Q5144801) (← links)
- Robustness and Strong Attack Tolerance of Low-Diameter Networks (Q5326889) (← links)
- A New Variant of the Minimum-Weight Maximum-Cardinality Clique Problem to Solve Conflicts between Aircraft (Q5356963) (← links)
- A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem (Q5867624) (← links)
- Algorithms for finding maximum transitive subtournaments (Q5963652) (← links)
- A characterization of the weighted Lovász number based on convex quadratic programming (Q5963688) (← links)
- On atomic cliques in temporal graphs (Q6043101) (← links)
- Partial Lasserre relaxation for sparse Max-Cut (Q6050383) (← links)
- MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
- Which networks permit stable allocations? A theory of network‐based comparisons (Q6059554) (← links)
- On maximum ratio clique relaxations (Q6085884) (← links)
- The minimum quasi-clique partitioning problem: complexity, formulations, and a computational study (Q6125237) (← links)
- Valid Inequalities and Separation Algorithms for the Set Partitioning Problem (Q6160432) (← links)
