Finding maximum cliques in arbitrary and in special graphs
From MaRDI portal
Publication:807639
DOI10.1007/BF02257777zbMATH Open0731.05029OpenAlexW1512959368MaRDI QIDQ807639FDOQ807639
Authors: Luitpold Babel 
Publication date: 1991
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02257777
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35)
Cites Work
- TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph
- Algorithm 457: finding all cliques of an undirected graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Incidence matrices and interval graphs
- Efficient algorithms for interval graphs and circular-arc graphs
- Algorithms on circular-arc graphs
- Vertex packings: Structural properties and algorithms
- Title not available (Why is that?)
- On maximal independent sets of vertices in claw-free graphs
- Steiner trees, partial 2–trees, and minimum IFI networks
- New methods to color the vertices of a graph
- Finding a Maximum Clique in an Arbitrary Graph
- Algorithmic Aspects of Vertex Elimination on Graphs
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- A Linear Recognition Algorithm for Cographs
- Algorithms for a maximum clique and a maximum independent set of a circle graph
- Stability in circular arc graphs
- The NP-completeness column: an ongoing guide
- Title not available (Why is that?)
- An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph
- Finding a Maximum Independent Set
- Title not available (Why is that?)
- The NP-completeness column: An ongoing guide
- An Analysis of Some Graph Theoretical Cluster Techniques
- A branch and bound algorithm for the maximum clique problem
- Determining the number of internal stability of a graph
- A new backtracking algorithm for generating the family of maximal independent sets of a graph
- Title not available (Why is that?)
- Clique detection for nondirected graphs: Two new algorithms
- Efficient algorithms for finding maximum cliques of an overlap graph
- A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles
- Finding maximum cliques in circle graphs
- A node covering algorithm
Cited In (26)
- On the minimum number of logical clauses inferred from examples
- An exact algorithm for the maximum stable set problem
- Solving the minimum-weighted coloring problem
- The maximum clique problem
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
- Novel evolutionary models and applications to sequence alignment problems
- Computing maximum \(k\)-defective cliques in massive graphs
- Hard graphs for the maximum clique problem
- A fast algorithm for the maximum clique problem
- Complexity results on graphs with few cliques
- A multi-KP modeling for the maximum-clique problem
- A fast algorithm for the maximum weight clique problem
- Clique-detection models in computational biochemistry and genomics
- A dynamic programming approach for timing and designing clique algorithms
- Iterative coloring extension of a maximum clique
- An algorithm for finding a maximum clique in a graph
- On finding \(k\)-cliques in \(k\)-partite graphs
- A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles
- Title not available (Why is that?)
- An extended formulation for the 1‐wheel inequalities of the stable set polytope
- Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
- Finding all \(k\)-cliques in \(k\)-partite graphs, an application in textile engineering
- Title not available (Why is that?)
- Title not available (Why is that?)
- A network-flow-based lower bound for the minimum weighted integer coloring problem
- Finding a Maximum Clique in an Arbitrary Graph
Uses Software
This page was built for publication: Finding maximum cliques in arbitrary and in special graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q807639)
