Clique detection for nondirected graphs: Two new algorithms
From MaRDI portal
Publication:1143177
DOI10.1007/BF02248731zbMath0441.68073MaRDI QIDQ1143177
Publication date: 1979
Published in: Computing (Search for Journal in Brave)
algorithmsparallel processingcliquesmaximal complete subgraphsnondirected graphstree search algorithms
Related Items
A multi-KP modeling for the maximum-clique problem, Solving the maximum clique problem using a tabu search approach, A graph-theoretic method for organizing overlapping clusters into trees, multiple trees, or extended trees, A global optimization approach for solving the maximum clique problem, An algorithm for finding a maximum weighted independent set in an arbitrary graph, An algorithm for generating all maximal independent subsets of posets, A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically, An exact algorithm for the maximum clique problem, A branch and bound algorithm for the maximum clique problem, A branch and bound algorithm for the maximum clique problem, Finding all \(k\)-cliques in \(k\)-partite graphs, an application in textile engineering, Using Fifth Generation Tools for Solving the Clique Number Problem, A new backtracking algorithm for generating the family of maximal independent sets of a graph, Enumerating all connected maximal common subgraphs in two graphs, Finding maximum cliques in arbitrary and in special graphs, The maximum clique problem
Uses Software
Cites Work
