Clique Finding with SAT - Maple Application Center

Clique Finding with SAT - Maple Application Center

Contact Maplesoft Request Quote

Submit your work

Application Center Applications Clique Finding with SAT

Clique Finding with SAT

Author

: Curtis Bright

Engineering software solutions from Maplesoft

This Application runs in Maple. Don't have Maple? No problem!

Try Maple free for 15 days!

A clique of a graph is a subset of its vertices that are all mutually connected. Finding a clique of a given size in a graph is a difficult problem in general. In this worksheet we demonstrate how to solve the clique finding problem by translating it into Boolean logic and using Maple's built-in efficient SAT solver. This approach even can out-perform the built-in Maple function FindClique which also solves the clique finding problem.

Application Details

Publish Date: November 15, 2018
Created In: Maple 2018
Language: English

Share

Copy URL

This app is not in any Collections

More Like This

Interactive Sudoku

Solving the World's Hardest Sudoku

Fuzzy Sets in Examples

Prof. Gennady P. Chuiko

Pascal's triangle and its relationship to the Fibonacci sequence

Maplesoft Author Maplesoft

Solving constraint satisfaction problems II: More difficult logic problems

Solving the Einstein Riddle

The n-Queens Problem

Finding Minimal Sum for Boolean Expression

Solving constraint satisfaction problems I: Logic problems

Prime Implicants of Boolean Expression by Concensus method

Polynomizing Lukasiewicz's Many-Valued Logics by Maple

Kahtan H. Alzubaidy

Introduction to Fuzzy Controllers