planarity testing
Also known as planarity problem
algorithmic problem of testing whether a given graph is a planar graph
Also known as planarity problem
algorithmic problem of testing whether a given graph is a planar graph
Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).