Algorithm for finding optimal boolean formula

  • Thread starter Thread starter twoflower
  • Start date Start date
  • Tags Tags
    Algorithm Formula
Click For Summary
SUMMARY

The discussion centers on finding an algorithm to identify all strongly connected components of a hypergraph. The user inquires about the applicability of Tarjan's algorithm for this purpose. Additionally, they mention K-Mapping and provide a link to a resource that explains logic minimization algorithms. The consensus is that Tarjan's algorithm is indeed suitable for solving the problem of strongly connected components in hypergraphs.

PREREQUISITES
  • Understanding of hypergraphs and their properties
  • Familiarity with Tarjan's algorithm for finding strongly connected components
  • Knowledge of logic minimization techniques, specifically K-Mapping
  • Basic programming skills to implement algorithms
NEXT STEPS
  • Research the implementation details of Tarjan's algorithm in graph theory
  • Explore additional algorithms for hypergraph analysis, such as Kosaraju's algorithm
  • Study logic minimization techniques beyond K-Mapping, including Quine-McCluskey
  • Investigate resources on hypergraph theory and applications in computer science
USEFUL FOR

Computer scientists, algorithm developers, and researchers focused on graph theory and hypergraph analysis will benefit from this discussion.

twoflower
Messages
363
Reaction score
0
EDIT: I'm sorry for confusing topic title, my thoughts were somewhere else :)

Hello to all,

I'm going to write program which will be finding all strongly connected components of hypergraph.

Strongly connected component is such connected maximal subhypergraph that there exists bidirectional path between each two points contained in it.

Well, is there any algorithm solving this? I found few articles mentioning Tarjan's algorithm, could it be used for such problem?

Thank you.
 
Technology news on Phys.org
Other than K-Mapping, I don't know much about logic minimization algorithms, but a quick google may yielded something you may find useful.

http://www.dei.isep.ipp.pt/~acc/bfunc/

It comes with explanation as well.
 
Last edited by a moderator:

Similar threads

Challenge: Find the minimum amount of draws possible for a list of integers
  • · Replies 9 ·
Replies
9
Views
3K
Optimization Programming - Which Algorithm?
  • · Replies 1 ·
Replies
1
Views
2K
MHB Divide Binary Search Tree at Key k: Algorithm & Analysis
  • · Replies 10 ·
Replies
10
Views
3K
Python Algorithm Optimization [Python]
  • · Replies 2 ·
Replies
2
Views
2K
Is Alan Turing given too much credit when it comes to computers?
  • · Replies 29 ·
Replies
29
Views
6K
Algorithm to find the smallest substring containing a set of....
  • · Replies 2 ·
Replies
2
Views
3K
Dimensionality of Network Topologies
  • · Replies 15 ·
Replies
15
Views
2K
Graduate Trajectory opimization: Fast preview algorithm
  • · Replies 1 ·
Replies
1
Views
2K
High School Are Inverse Problems More Complex Than Direct Problems in Mathematics?
  • · Replies 13 ·
Replies
13
Views
3K
Rienforced Concrete Column Cost Optimization with Genetic Algorithm
  • · Replies 2 ·
Replies
2
Views
3K