On the Maximum Weight Clique Problem
From MaRDI portal
Recommendations
Cited in
(40)- A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring
- On a composition of independence systems by circuit identification
- Cliques and clustering: A combinatorial approach
- Binary interactions and subset choice
- HEWN: A polynomial algorithm for CLIQUE problem
- The maximum clique problem
- Vertex packing problem application to the design of electronic testing fixtures
- On the use of Boolean methods for the computation of the stability number
- Algorithms for maximum weight induced paths
- Clustered maximum weight clique problem: algorithms and empirical analysis
- Maximum weight relaxed cliques and Russian doll search revisited
- Co-bipartite neighborhood edge elimination orderings
- Maximum dispersion and geometric maximum weight cliques
- Scheduling independent tasks with multiple modes
- Finding cliques of maximum weight on a generalization of permutation graphs
- A branch-and-price procedure for clustering data that are graph connected
- Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph
- The maximum independent union of cliques problem: complexity and exact approaches
- Genetic algorithmic approach to find the maximum weight independent set of a graph
- A new algorithm for the maximum-weight clique problem
- On bipartite and multipartite clique problems
- A complementary pivoting approach to the maximum weight clique problem
- An algorithm for finding a maximum weighted independent set in an arbitrary graph
- Real-time systems: incomplete solution approach for the maximum-weighted clique problem
- scientific article; zbMATH DE number 3908479 (Why is no real title available?)
- On graphs with polynomially solvable maximum-weight clique problem
- scientific article; zbMATH DE number 26478 (Why is no real title available?)
- Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number
- scientific article; zbMATH DE number 1786225 (Why is no real title available?)
- Star partitions and the graph isomorphism problem
- Maximum weight archipelago subgraph problem
- A labeling order scheme for the maximum clique problem
- Complexity results on graphs with few cliques
- A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem
- Parameterized complexity for iterated type partitions and modular-width
- Maximum max-k-clique subgraphs in cactus subtree graphs
- The combinatorics of pivoting for the maximum weight clique.
- Optimal wafer cutting in shuttle layout problems
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- Finding a maximum-weight induced \(k\)-partite subgraph of an \(i\)-triangulated graph
This page was built for publication: On the Maximum Weight Clique Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3762347)
