Yarn

Recent twts in reply to #zaxrfna

with resolving inconsistent graph preferences, does the portion of non-uniquely resolvable preferences shrink with the number of options? in other words: for the set ๐“–_n of all graphs with n nodes, and the set U(๐“–_n) of those graphs with a unique path-graph with a smallest graph-edit distance, is |U(๐“–_n)|/๐“–n<|U(๐“–{n+1})|/|๐“–_{n+1}|?

โค‹ Read More

Participate

Login to join in on this yarn.