On the Maximum Weight Clique Problem
From MaRDI portal
Publication:3762347
DOI10.1287/moor.12.3.522zbMath0624.05040OpenAlexW2037982899MaRDI QIDQ3762347
Jaroslav Nešetřil, Vašek Chvátal, Egon Balas
Publication date: 1987
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.12.3.522
Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10)
Related Items
Vertex packing problem application to the design of electronic testing fixtures, A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring, Scheduling independent tasks with multiple modes, Fixed interval scheduling: models, applications, computational complexity and algorithms, On the use of Boolean methods for the computation of the stability number, The maximum independent union of cliques problem: complexity and exact approaches, An algorithm for finding a maximum weighted independent set in an arbitrary graph, Star partitions and the graph isomorphism problem, Parameterized complexity for iterated type partitions and modular-width, On a composition of independence systems by circuit identification, Genetic algorithmic approach to find the maximum weight independent set of a graph, Optimal wafer cutting in shuttle layout problems, Cliques and clustering: A combinatorial approach, Binary interactions and subset choice, A branch-and-price procedure for clustering data that are graph connected, A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem, The maximum clique problem
