Pages that link to "Item:Q3762347"

The following pages link to On the Maximum Weight Clique Problem (Q3762347):

Displaying 35 items.

• Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number (Q450563) (← links)
• Maximum weight archipelago subgraph problem (Q490157) (← links)
• The combinatorics of pivoting for the maximum weight clique. (Q703275) (← links)
• Optimal wafer cutting in shuttle layout problems (Q719028) (← links)
• Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
• Finding a maximum-weight induced \(k\)-partite subgraph of an \(i\)-triangulated graph (Q972337) (← links)
• A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring (Q1095923) (← links)
• On a composition of independence systems by circuit identification (Q1186136) (← links)
• Cliques and clustering: A combinatorial approach (Q1267180) (← links)
• Binary interactions and subset choice (Q1268247) (← links)
• HEWN: A polynomial algorithm for CLIQUE problem (Q1288412) (← links)
• The maximum clique problem (Q1318271) (← links)
• Vertex packing problem application to the design of electronic testing fixtures (Q1339134) (← links)
• On the use of Boolean methods for the computation of the stability number (Q1363750) (← links)
• Algorithms for maximum weight induced paths (Q1603504) (← links)
• Clustered maximum weight clique problem: algorithms and empirical analysis (Q1652358) (← links)
• Maximum weight relaxed cliques and Russian doll search revisited (Q1686057) (← links)
• Co-bipartite neighborhood edge elimination orderings (Q1689989) (← links)
• Maximum dispersion and geometric maximum weight cliques (Q1879248) (← links)
• Scheduling independent tasks with multiple modes (Q1900136) (← links)
• Finding cliques of maximum weight on a generalization of permutation graphs (Q1940437) (← links)
• A branch-and-price procedure for clustering data that are graph connected (Q2060392) (← links)
• Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph (Q2097180) (← links)
• The maximum independent union of cliques problem: complexity and exact approaches (Q2174276) (← links)
• Genetic algorithmic approach to find the maximum weight independent set of a graph (Q2471331) (← links)
• A new algorithm for the maximum-weight clique problem (Q2741359) (← links)
• On bipartite and multipartite clique problems (Q2775896) (← links)
• A complementary pivoting approach to the maximum weight clique problem (Q2784445) (← links)
• An algorithm for finding a maximum weighted independent set in an arbitrary graph (Q3210915) (← links)
• On graphs with polynomially solvable maximum-weight clique problem (Q3809822) (← links)
• The maximum edge-weighted clique problem in complete multipartite graphs (Q3983239) (← links)
• Star partitions and the graph isomorphism problem (Q4853929) (← links)
• A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem (Q5867624) (← links)
• Parameterized complexity for iterated type partitions and modular-width (Q6126724) (← links)
• Maximum max-k-clique subgraphs in cactus subtree graphs (Q6132893) (← links)