I have a compatibility matrix, where 0 means that two elements are compatible, 1 means they are not.
I need to find the longest possible vector of unique elements such that all elements are compatible with each other.
Here is the matrix
I can find many empirical ways to start and see how far I can go, but is there a mathematically sound algorithms that ensures me to find the longest possible vector?
Just to be clear, I'm looking at something like:
v = [A, B, F, I...]
where all elements are compatible with each other.