Pages that link to "Item:Q3741641"

The following pages link to Finding a Maximum Clique in an Arbitrary Graph (Q3741641):

Displaying 50 items.

• A generalization of chordal graphs and the maximum clique problem (Q287036) (← links)
• Chordal editing is fixed-parameter tractable (Q300460) (← links)
• An integer programming approach for solving the \(p\)-dispersion problem (Q323154) (← links)
• Heuristics for the generalized median graph problem (Q323345) (← links)
• Breakout local search for maximum clique problems (Q339563) (← links)
• Infra-chromatic bound for exact maximum clique search (Q342100) (← links)
• A new exact maximum clique algorithm for large and massive sparse graphs (Q342165) (← links)
• An adaptive multistart tabu search approach to solve the maximum clique problem (Q358651) (← links)
• Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations (Q360375) (← links)
• On finding \(k\)-cliques in \(k\)-partite graphs (Q360493) (← links)
• An exact algorithm for the maximum probabilistic clique problem (Q405671) (← links)
• On risk-averse maximum weighted subgraph problems (Q405680) (← links)
• A branch and cut solver for the maximum stable set problem (Q491210) (← links)
• A parallel maximum clique algorithm for large and massive sparse graphs (Q526419) (← links)
• Variable neighborhood search for the maximum clique (Q705505) (← links)
• An exact approach to the problem of extracting an embedded network matrix (Q716336) (← links)
• TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph (Q750320) (← links)
• Finding maximum cliques in arbitrary and in special graphs (Q807639) (← links)
• Balanced independent and dominating sets on colored interval graphs (Q831789) (← links)
• An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments (Q868636) (← links)
• Answering ``why empty?'' and ``why so many?'' queries in graph databases (Q891677) (← links)
• The discrete p-dispersion problem (Q915643) (← links)
• An exact algorithm for the maximum clique problem (Q922964) (← links)
• On the complexity of some subgraph problems (Q967414) (← links)
• Approximating the maximum vertex/edge weighted clique using local search (Q1009183) (← links)
• A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring (Q1095923) (← links)
• Maximal chordal subgraphs (Q1115455) (← links)
• Reduction of indefinite quadratic programs to bilinear programs (Q1187369) (← links)
• Detecting embedded Horn structure in propositional logic (Q1198035) (← links)
• Counting clique trees and computing perfect elimination schemes in parallel (Q1262131) (← links)
• STABULUS: A technique for finding stable sets in large graphs with tabu search (Q1262136) (← links)
• An algorithm for finding a maximum clique in a graph (Q1267190) (← links)
• Facets for node packing (Q1278997) (← links)
• Test case generators and computational results for the maximum clique problem (Q1310979) (← links)
• A fast algorithm for the maximum weight clique problem (Q1316588) (← links)
• The maximum clique problem (Q1318271) (← links)
• An exact algorithm for the maximum stable set problem (Q1328431) (← links)
• A multi-KP modeling for the maximum-clique problem (Q1328650) (← links)
• Vertex packing problem application to the design of electronic testing fixtures (Q1339134) (← links)
• Solving the anti-covering location problem using Lagrangian relaxation (Q1373891) (← links)
• A combinatorial column generation algorithm for the maximum stable set problem (Q1374381) (← links)
• Enumerating all connected maximal common subgraphs in two graphs (Q1589412) (← links)
• A fast algorithm for the maximum clique problem (Q1613374) (← links)
• Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights (Q1640044) (← links)
• Ramsey theory and integrality gap for the independent set problem (Q1667206) (← links)
• The maximum clique interdiction problem (Q1735171) (← links)
• Decomposing clique search problems into smaller instances based on node and edge colorings (Q1744248) (← links)
• \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates (Q1804563) (← links)
• Modelling competitive Hopfield networks for the maximum clique problem (Q1870811) (← links)
• A graph-theoretic method for organizing overlapping clusters into trees, multiple trees, or extended trees (Q1907945) (← links)