maximum independent set problem
Sign in to saveAlso known as independent set problem
problem to find an independent set of graph vertices of maximal size
Also known as independent set problem
problem to find an independent set of graph vertices of maximal size
Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).