Clique detection for nondirected graphs: Two new algorithms
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3144145 (Why is no real title available?)
- scientific article; zbMATH DE number 3528255 (Why is no real title available?)
- scientific article; zbMATH DE number 3254945 (Why is no real title available?)
- Algorithm 457: finding all cliques of an undirected graph
- An algorithm for the chromatic number of a graph
- Clique detection in directed graphs: A new algorithm
- Maximum internally stable sets of a graph
- On cliques in graphs
Cited in
(16)- The maximum clique problem
- A branch and bound algorithm for the maximum clique problem
- A global optimization approach for solving the maximum clique problem
- A graph-theoretic method for organizing overlapping clusters into trees, multiple trees, or extended trees
- An algorithm for finding a maximum weighted independent set in an arbitrary graph
- An algorithm for generating all maximal independent subsets of posets
- A branch and bound algorithm for the maximum clique problem
- An exact algorithm for the maximum clique problem
- A multi-KP modeling for the maximum-clique problem
- A new backtracking algorithm for generating the family of maximal independent sets of a graph
- Using Fifth Generation Tools for Solving the Clique Number Problem
- A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically
- Solving the maximum clique problem using a tabu search approach
- Finding maximum cliques in arbitrary and in special graphs
- Finding all \(k\)-cliques in \(k\)-partite graphs, an application in textile engineering
- Enumerating all connected maximal common subgraphs in two graphs
This page was built for publication: Clique detection for nondirected graphs: Two new algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1143177)
