The maximum clique problem (Q1318271): Difference between revisions

@@ Property / author @@
+Panos M. Pardalos
@@ Property / author: Panos M. Pardalos / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+TABARIS
@@ Property / describes a project that uses: TABARIS / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Algorithm 457
@@ Property / describes a project that uses: Algorithm 457 / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+DIMACS
@@ Property / describes a project that uses: DIMACS / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Optima of dual integer linear programs
@@ Property / cites work: Optima of dual integer linear programs / rank @@
+Normal rank
@@ Property / cites work @@
+On the independence ratio of a graph
@@ Property / cites work: On the independence ratio of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+A fast and simple randomized parallel algorithm for the maximal independent set problem
+Normal rank
@@ Property / cites work @@
+Upper Bounds on the Order of a Clique of a Graph
@@ Property / cites work: Upper Bounds on the Order of a Clique of a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q4230322
@@ Property / cites work: Q4230322 / rank @@
+Normal rank
@@ Property / cites work @@
+An Analysis of Some Graph Theoretical Cluster Techniques
+Normal rank
@@ Property / cites work @@
+Structure preserving reductions among convex optimization problems
+Normal rank
@@ Property / cites work @@
+Finding maximum cliques in arbitrary and in special graphs
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for the maximum clique problem
+Normal rank
@@ Property / cites work @@
+A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring
+Normal rank
@@ Property / cites work @@
+On the Maximum Weight Clique Problem
@@ Property / cites work: On the Maximum Weight Clique Problem / rank @@
+Normal rank
@@ Property / cites work @@
+A node covering algorithm
@@ Property / cites work: A node covering algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
+Normal rank
@@ Property / cites work @@
+Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
+Normal rank
@@ Property / cites work @@
+Finding a Maximum Clique in an Arbitrary Graph
@@ Property / cites work: Finding a Maximum Clique in an Arbitrary Graph / rank @@
+Normal rank
@@ Property / cites work @@
+On graphs with polynomially solvable maximum-weight clique problem
+Normal rank
@@ Property / cites work @@
+Q3337223
@@ Property / cites work: Q3337223 / rank @@
+Normal rank
@@ Property / cites work @@
+Design and Implementation of an Interactive Optimization System for Telephone Network Planning
+Normal rank
@@ Property / cites work @@
+Q5541377
@@ Property / cites work: Q5541377 / rank @@
+Normal rank
@@ Property / cites work @@
+An upper bound on the size of the largest cliques in a graph
+Normal rank
@@ Property / cites work @@
+Cliques in random graphs
@@ Property / cites work: Cliques in random graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On Some Clustering Techniques
@@ Property / cites work: On Some Clustering Techniques / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating maximum independent sets by excluding subgraphs
+Normal rank
@@ Property / cites work @@
+Polytope des independants d'un graphe série-parallèle
+Normal rank
@@ Property / cites work @@
+New methods to color the vertices of a graph
@@ Property / cites work: New methods to color the vertices of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithm 457: finding all cliques of an undirected graph
+Normal rank
@@ Property / cites work @@
+A new table of constant weight codes
@@ Property / cites work: A new table of constant weight codes / rank @@
+Normal rank
@@ Property / cites work @@
+Q3222886
@@ Property / cites work: Q3222886 / rank @@
+Normal rank
@@ Property / cites work @@
+The maximum independent set problem for cubic planar graphs
+Normal rank
@@ Property / cites work @@
+An exact algorithm for the maximum clique problem
@@ Property / cites work: An exact algorithm for the maximum clique problem / rank @@
+Normal rank
@@ Property / cites work @@
+Finding a maximum set of independent chords in a circle
+Normal rank
@@ Property / cites work @@
+Arboricity and Subgraph Listing Algorithms
@@ Property / cites work: Arboricity and Subgraph Listing Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+An Approximation Algorithm for the Maximum Independent Set Problem on Planar Graphs
+Normal rank
@@ Property / cites work @@
+An algorithm for finding a large independent set in planar graphs
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for the maximum independent set problem in cubic planar graphs
+Normal rank
@@ Property / cites work @@
+Q4083324
@@ Property / cites work: Q4083324 / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient parallel algorithm for computing a large independent set in a planar graph
+Normal rank
@@ Property / cites work @@
+On certain polytopes associated with graphs
@@ Property / cites work: On certain polytopes associated with graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Determining the Stability Number of a Graph
@@ Property / cites work: Determining the Stability Number of a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+A Greedy Heuristic for the Set-Covering Problem
@@ Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Which claw-free graphs are perfectly orderable?
@@ Property / cites work: Which claw-free graphs are perfectly orderable? / rank @@
+Normal rank
@@ Property / cites work @@
+A combinatorial approach for Keller's conjecture
@@ Property / cites work: A combinatorial approach for Keller's conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the approximation of the MAX CLIQUE problem
+Normal rank
@@ Property / cites work @@
+Q3804207
@@ Property / cites work: Q3804207 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4058122
@@ Property / cites work: Q4058122 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4770975
@@ Property / cites work: Q4770975 / rank @@
+Normal rank
@@ Property / cites work @@
+A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
+Normal rank
@@ Property / cites work @@
+On rigid circuit graphs
@@ Property / cites work: On rigid circuit graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3682509
@@ Property / cites work: Q3682509 / rank @@
+Normal rank
@@ Property / cites work @@
+Covers and packings in a family of sets
@@ Property / cites work: Covers and packings in a family of sets / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for the clique and the chromatic numbers of a graph
+Normal rank
@@ Property / cites work @@
+Clique numbers of graphs
@@ Property / cites work: Clique numbers of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Über iterierte Clique-Graphen
@@ Property / cites work: Über iterierte Clique-Graphen / rank @@
+Normal rank
@@ Property / cites work @@
+Q3872499
@@ Property / cites work: Q3872499 / rank @@
+Normal rank
@@ Property / cites work @@
+A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
+Normal rank
@@ Property / cites work @@
+On the Greedy Heuristic for Continuous Covering and Packing Problems
+Normal rank
@@ Property / cites work @@
+STABULUS: A technique for finding stable sets in large graphs with tabu search
+Normal rank
@@ Property / cites work @@
+TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph
+Normal rank
@@ Property / cites work @@
+On the independence number of random graphs
@@ Property / cites work: On the independence number of random graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The number of maximal independent sets in connected graphs
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
+Normal rank
@@ Property / cites work @@
+Algorithms for a maximum clique and a maximum independent set of a circle graph
+Normal rank
@@ Property / cites work @@
+Algorithms on circular-arc graphs
@@ Property / cites work: Algorithms on circular-arc graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3793964
@@ Property / cites work: Q3793964 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving the maximum clique problem using a tabu search approach
+Normal rank
@@ Property / cites work @@
+Clique detection for nondirected graphs: Two new algorithms
+Normal rank
@@ Property / cites work @@
+Matrices with the Edmonds-Johnson property
@@ Property / cites work: Matrices with the Edmonds-Johnson property / rank @@
+Normal rank
@@ Property / cites work @@
+On stable set polyhedra for K//(1,3)free graphs
@@ Property / cites work: On stable set polyhedra for K//(1,3)free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A New Parallel Algorithm for the Maximal Independent Set Problem
+Normal rank
@@ Property / cites work @@
+Constructing a Maximal Independent Set in Parallel
+Normal rank
@@ Property / cites work @@
+A simple lower bound for monotone clique using a communication game
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Stability in circular arc graphs
@@ Property / cites work: Stability in circular arc graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds on the independence number in terms of the degrees
+Normal rank
@@ Property / cites work @@
+The number of maximal independent sets in a connected graph
+Normal rank
@@ Property / cites work @@
+Random near-regular graphs and the node packing problem
+Normal rank
@@ Property / cites work @@
+The ellipsoid method and its consequences in combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Relaxations of vertex packing
@@ Property / cites work: Relaxations of vertex packing / rank @@
+Normal rank
@@ Property / cites work @@
+Geometric algorithms and combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Q3216686
@@ Property / cites work: Q3216686 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for interval graphs and circular-arc graphs
+Normal rank
@@ Property / cites work @@
+Expected Computation Time for Hamiltonian Path problem
+Normal rank
@@ Property / cites work @@
+Active constraints, indefinite quadratic test problems, and complexity
+Normal rank
@@ Property / cites work @@
+Maximum internally stable sets of a graph
@@ Property / cites work: Maximum internally stable sets of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Vertices Belonging to All or to No Maximum Stable Sets of a Graph
+Normal rank
@@ Property / cites work @@
+Q4100118
@@ Property / cites work: Q4100118 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3861430
@@ Property / cites work: Q3861430 / rank @@
+Normal rank
@@ Property / cites work @@
+Test case generators and computational results for the maximum clique problem
+Normal rank
@@ Property / cites work @@
+Weakly triangulated graphs
@@ Property / cites work: Weakly triangulated graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Optimizing weakly triangulated graphs
@@ Property / cites work: Optimizing weakly triangulated graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The maximum number of cliques in dense graphs
@@ Property / cites work: The maximum number of cliques in dense graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On linear systems with integral valued solutions
@@ Property / cites work: On linear systems with integral valued solutions / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs
+Normal rank
@@ Property / cites work @@
+Hard graphs for the maximum clique problem
@@ Property / cites work: Hard graphs for the maximum clique problem / rank @@
+Normal rank
@@ Property / cites work @@
+An Algorithm for the Vertex Packing Problem
@@ Property / cites work: An Algorithm for the Vertex Packing Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle Graphs
+Normal rank
@@ Property / cites work @@
+A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for combinatorial problems
+Normal rank
@@ Property / cites work @@
+On generating all maximal independent sets
@@ Property / cites work: On generating all maximal independent sets / rank @@
+Normal rank
@@ Property / cites work @@
+Degree-two Inequalities, Clique Facets, and Biperfect Graphs
+Normal rank
@@ Property / cites work @@
+Cliques of a graph-variations on the Bron-Kerbosch algorithm
+Normal rank
@@ Property / cites work @@
+A fast parallel algorithm for the maximal independent set problem
+Normal rank
@@ Property / cites work @@
+Generation of maximum independent sets of a bipartite graph and maximum cliques of a circular-arc graph
+Normal rank
@@ Property / cites work @@
+Q4723768
@@ Property / cites work: Q4723768 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4731205
@@ Property / cites work: Q4731205 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3798257
@@ Property / cites work: Q3798257 / rank @@
+Normal rank
@@ Property / cites work @@
+Keller’s cube-tiling conjecture is false in high dimensions
+Normal rank
@@ Property / cites work @@
+Q3048571
@@ Property / cites work: Q3048571 / rank @@
+Normal rank
@@ Property / cites work @@
+Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
+Normal rank
@@ Property / cites work @@
+Hard Enumeration Problems in Geometry and Combinatorics
+Normal rank
@@ Property / cites work @@
+A Separator Theorem for Planar Graphs
@@ Property / cites work: A Separator Theorem for Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Applications of a Planar Separator Theorem
@@ Property / cites work: Applications of a Planar Separator Theorem / rank @@
+Normal rank
@@ Property / cites work @@
+A new backtracking algorithm for generating the family of maximal independent sets of a graph
+Normal rank
@@ Property / cites work @@
+A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically
+Normal rank
@@ Property / cites work @@
+Determining the number of internal stability of a graph
+Normal rank
@@ Property / cites work @@
+An algorithm for the maximum internally stable set in a weighted graph
+Normal rank
@@ Property / cites work @@
+On the Shannon capacity of a graph
@@ Property / cites work: On the Shannon capacity of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q3745276
@@ Property / cites work: Q3745276 / rank @@
+Normal rank
@@ Property / cites work @@
+A Simple Parallel Algorithm for the Maximal Independent Set Problem
+Normal rank
@@ Property / cites work @@
+Q3893810
@@ Property / cites work: Q3893810 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3261003
@@ Property / cites work: Q3261003 / rank @@
+Normal rank
@@ Property / cites work @@
+An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for finding maximum cliques of an overlap graph
+Normal rank
@@ Property / cites work @@
+Q5610923
@@ Property / cites work: Q5610923 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4003439
@@ Property / cites work: Q4003439 / rank @@
+Normal rank
@@ Property / cites work @@
+Clique detection in directed graphs: A new algorithm
+Normal rank
@@ Property / cites work @@
+On the perfect graph conjecture
@@ Property / cites work: On the perfect graph conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+On maximal independent sets of vertices in claw-free graphs
+Normal rank
@@ Property / cites work @@
+On cliques in graphs
@@ Property / cites work: On cliques in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Clique partitions, graph compression and speeding-up algorithms
+Normal rank
@@ Property / cites work @@
+Maxima for Graphs and a New Proof of a Theorem of Turán
+Normal rank
@@ Property / cites work @@
+Corrections to Bierstone's Algorithm for Generating Cliques
+Normal rank
@@ Property / cites work @@
+Computing independent sets in graphs with large girth
+Normal rank
@@ Property / cites work @@
+A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
+Normal rank
@@ Property / cites work @@
+Properties of vertex packing and independence system polyhedra
+Normal rank
@@ Property / cites work @@
+Vertex packings: Structural properties and algorithms
+Normal rank
@@ Property / cites work @@
+Q4040221
@@ Property / cites work: Q4040221 / rank @@
+Normal rank
@@ Property / cites work @@
+Weak bipolarizable graphs
@@ Property / cites work: Weak bipolarizable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the diameter of convex polytopes
@@ Property / cites work: On the diameter of convex polytopes / rank @@
+Normal rank
@@ Property / cites work @@
+A clique-detection algorithm based on neighborhoods in graphs
+Normal rank
@@ Property / cites work @@
+On the facial structure of set packing polyhedra
@@ Property / cites work: On the facial structure of set packing polyhedra / rank @@
+Normal rank
@@ Property / cites work @@
+Q4182528
@@ Property / cites work: Q4182528 / rank @@
+Normal rank
@@ Property / cites work @@
+Covering, Packing and Knapsack Problems
@@ Property / cites work: Covering, Packing and Knapsack Problems / rank @@
+Normal rank
@@ Property / cites work @@
+(1,k)-configurations and facets for packing problems
+Normal rank
@@ Property / cites work @@
+An algorithm for finding a maximum weighted independent set in an arbitrary graph
+Normal rank
@@ Property / cites work @@
+A global optimization approach for solving the maximum clique problem
+Normal rank
@@ Property / cites work @@
+Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture
+Normal rank
@@ Property / cites work @@
+Computational aspects of a branch and bound algorithm for quadratic zero- one programming
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for the maximum clique problem
+Normal rank
@@ Property / cites work @@
+Constrained global optimization: algorithms and applications
+Normal rank
@@ Property / cites work @@
+Über lückenlose Ausfüllung des \(n\)-dimensionalen Raumes durch kongruente Würfel
+Normal rank
@@ Property / cites work @@
+On the integer-valued variables in the linear vertex packing problem
+Normal rank
@@ Property / cites work @@
+On the probable behaviour of some algorithms for finding the stability number of a graph
+Normal rank
@@ Property / cites work @@
+The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
+Normal rank
@@ Property / cites work @@
+Minimum node covers and 2-bicritical graphs
@@ Property / cites work: Minimum node covers and 2-bicritical graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic construction of deterministic algorithms: approximating packing integer programs
+Normal rank
@@ Property / cites work @@
+Algorithms for maximum independent sets
@@ Property / cites work: Algorithms for maximum independent sets / rank @@
+Normal rank
@@ Property / cites work @@
+Triangulated graphs and the elimination process
@@ Property / cites work: Triangulated graphs and the elimination process / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic Aspects of Vertex Elimination on Graphs
+Normal rank
@@ Property / cites work @@
+Finding maximum cliques in circle graphs
@@ Property / cites work: Finding maximum cliques in circle graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Note on Independent Sets in Trees
@@ Property / cites work: A Note on Independent Sets in Trees / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of test case generation for NP-hard problems
+Normal rank
@@ Property / cites work @@
+Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
+Normal rank
@@ Property / cites work @@
+Dual quadratic estimates in polynomial and Boolean programming
+Normal rank
@@ Property / cites work @@
+Stability number of bull- and chair-free graphs
@@ Property / cites work: Stability number of bull- and chair-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On cliques in graphs
@@ Property / cites work: On cliques in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Some Ramsey-Type Numbers and the Independence Ratio
+Normal rank
@@ Property / cites work @@
+Algebraic Tiling
@@ Property / cites work: Algebraic Tiling / rank @@
+Normal rank
@@ Property / cites work @@
+Q3309631
@@ Property / cites work: Q3309631 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding a Maximum Independent Set
@@ Property / cites work: Finding a Maximum Independent Set / rank @@
+Normal rank
@@ Property / cites work @@
+Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
+Normal rank
@@ Property / cites work @@
+Q5184913
@@ Property / cites work: Q5184913 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing and Combinatorics
@@ Property / cites work: Computing and Combinatorics / rank @@
+Normal rank
@@ Property / cites work @@
+A class of facet producing graphs for vertex packing polyhedra
+Normal rank
@@ Property / cites work @@
+A New Algorithm for Generating All the Maximal Independent Sets
+Normal rank
@@ Property / cites work @@
+On the theory of graphs
@@ Property / cites work: On the theory of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Enumeration and Reliability Problems
+Normal rank
@@ Property / cites work @@
+Improving the performance guarantee for approximate graph coloring
+Normal rank
@@ Property / cites work @@
+The Number of Maximal Independent Sets in a Tree
@@ Property / cites work: The Number of Maximal Independent Sets in a Tree / rank @@
+Normal rank
@@ Property / cites work @@
+Q3777423
@@ Property / cites work: Q3777423 / rank @@
+Normal rank
@@ Property / cites work @@
+Spectral bounds for the clique and independence numbers of graphs
+Normal rank
@@ Property / cites work @@
+Edge‐maximal triangulated subgraphs and heuristics for the maximum clique problem
+Normal rank
@@ Property / cites work @@
+Q4277623
@@ Property / cites work: Q4277623 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4698131
@@ Property / cites work: Q4698131 / rank @@
+Normal rank
@@ Property / cites work @@
+Sequential and parallel algorithms for the maximum-weight independent set problem on permutation graphs
+Normal rank