Discovering Maximum Bisimilarity in Graphs: A Scientific Inquiry

  • Context: Graduate 
  • Thread starter Thread starter XodoX
  • Start date Start date
Click For Summary
SUMMARY

This discussion centers on identifying the maximum bisimilarity in graphs, specifically focusing on finding the pair of points or paths with the highest degree of bisimilarity. The inquiry emphasizes the need for methodologies to determine this optimal pair among all possible paths. Participants seek clarification on existing techniques and any recent advancements in the field of graph theory related to bisimulation.

PREREQUISITES
  • Understanding of graph theory concepts, particularly bisimulation.
  • Familiarity with algorithms for pathfinding in graphs.
  • Knowledge of mathematical optimization techniques.
  • Experience with graph visualization tools, such as Graphviz.
NEXT STEPS
  • Research algorithms for computing bisimulation equivalence in graphs.
  • Explore optimization techniques for identifying maximum bisimilarity.
  • Learn about graph traversal methods, such as Depth-First Search (DFS) and Breadth-First Search (BFS).
  • Investigate recent publications on advancements in graph theory and bisimulation.
USEFUL FOR

Researchers in graph theory, data scientists working with network analysis, and software developers implementing graph algorithms will benefit from this discussion.

XodoX
Messages
195
Reaction score
0
When you have a graph like this one here:

https://www.dropbox.com/s/tchpodpt2gp1huf/Bisimulation.jpg

Of course you find bisimilar points/paths. There must be two points or path that have the "greatest" bisimilarity of all. Is this not correct ? And if you have that kind of bisimilarity, how do you find it among all the paths ?
In other words, where is the pair that is more bisimilar than all the others?
 
Physics news on Phys.org
I'm sorry you are not generating any responses at the moment. Is there any additional information you can share with us? Any new findings?
 

Similar threads

  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 11 ·
Replies
11
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
5
Views
2K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 62 ·
3
Replies
62
Views
5K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K