Using Fifth Generation Tools for Solving the Clique Number Problem

DOI10.1080/02522667.1989.10698985zbMath0796.68165OpenAlexW1977840761MaRDI QIDQ4712613

J.-C. Panayiotopoulos

Publication date: 25 June 1992

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.1989.10698985

zbMATH Keywords

parallel computationclique numberNP-complete

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Cites Work

• Clique detection for nondirected graphs: Two new algorithms
• An observation on time-storage trade off
• Finding a Maximum Clique in an Arbitrary Graph
• Determining the number of internal stability of a graph
• Algorithms on circular-arc graphs
• A New Algorithm for Generating All the Maximal Independent Sets
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
• Algorithms for a maximum clique and a maximum independent set of a circle graph
• Algorithm 457: finding all cliques of an undirected graph
• Solving Linear Programs in Polynomial-Time
• Unnamed Item

This page was built for publication: Using Fifth Generation Tools for Solving the Clique Number Problem