Clique detection for nondirected graphs: Two new algorithms

DOI10.1007/BF02248731zbMath0441.68073MaRDI QIDQ1143177

L. Gerhards, W. Lindenberg

Publication date: 1979

Published in: Computing (Search for Journal in Brave)

zbMATH Keywords

algorithms; parallel processing; cliques; maximal complete subgraphs; nondirected graphs; tree search algorithms

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

05C99: Graph theory

Related Items

Using Fifth Generation Tools for Solving the Clique Number 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, A new backtracking algorithm for generating the family of maximal independent sets of a graph, Finding maximum cliques in arbitrary and in special graphs, An exact algorithm for the maximum clique problem, 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, The maximum clique problem, A multi-KP modeling for the maximum-clique problem, Enumerating all connected maximal common subgraphs in two graphs, A graph-theoretic method for organizing overlapping clusters into trees, multiple trees, or extended trees, Solving the maximum clique problem using a tabu search approach, An algorithm for finding a maximum weighted independent set in an arbitrary graph, A global optimization approach for solving the maximum clique problem

Uses Software

• Algorithm 457

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Clique detection in directed graphs: A new algorithm
• Maximum internally stable sets of a graph
• An algorithm for the chromatic number of a graph
• Algorithm 457: finding all cliques of an undirected graph
• On cliques in graphs