query: Trying to remove duplicate isomorphic graphs in a list of graphs
positive_passages.docid: 18980
positive_passages.text: Deleting isomorphic graphs efficiently
negative_passages.docid: 117424
negative_passages.text: Simple way to find if two different lists contain exactly the same elements?
negative_passages.docid: 150119
negative_passages.text: Scheme removing nested duplicates
negative_passages.docid: 79631
negative_passages.text: Find a graph on eight vertices with a pair of pseudosimilar vertices
negative_passages.docid: 136389
negative_passages.text: Finding an isomorphic subring of matrices
negative_passages.docid: 112188
negative_passages.text: Duplicate Permutations with Tuples
negative_passages.docid: 94576
negative_passages.text: Removing unnecessary vertices?
negative_passages.docid: 147572
negative_passages.text: How to make many copies of similar graphs systematically?
negative_passages.docid: 102702
negative_passages.text: Check if all elements in a list are identical
negative_passages.docid: 35506
negative_passages.text: remove duplicate from list and create non-duplicate id set
negative_passages.docid: 61136
negative_passages.text: How to find all graph isomorphisms in FindGraphIsomorphism
negative_passages.docid: 137337
negative_passages.text: Removing duplicates from a list collection
negative_passages.docid: 88193
negative_passages.text: Removing duplicates before train test split
negative_passages.docid: 4264
negative_passages.text: How to make a flat list out of a list of lists?
negative_passages.docid: 9835
negative_passages.text: Removing elements from a list which appear in another list
negative_passages.docid: 64728
negative_passages.text: Is there any way to remove edges causing a loop?
negative_passages.docid: 45434
negative_passages.text: How to keep unique items from a collection of similar items in a list?