<p><a href="http://cs.anu.edu.au/~bdm/nauty/">NAUTY</a> can be used as a library to help you build a hashtable for the entire poset of graph minors for small $n$.  The key would be the cannonial form given by NAUTY and the value would be a concatenation in sorted order of the cannonical forms of it's direct minors.</p>

CC BY-SA 3.0
2014-02-26T22:25:24.800Z
Yes, but nauty doesn't (as far as I know) provide any methods for *finding minors in the first place*. Also, given that the question was about merely the presence/absence of a specific set of minors, I don't see how building a hashtable out of all instances helps solve that initial problem...
Joshua Grochow
CC BY-SA 3.0
2014-02-26T22:41:22.303Z
Wendy Myrvold and Brendan McKay do a lot of graph minor research with NAUTY as a support library. DFS on deletions/joins until you get down to a tractable number of vertices then query the pre-computed poset. How you do the DFS will depend on what type of minor you are looking for.
Chad Brewbaker
CC BY-SA 3.0
2014-02-26T22:46:29.547Z
Interesting! You should make that part of the answer. Also, can you give a reference? I couldn't find it.
Joshua Grochow
CC BY-SA 3.0
2014-02-26T17:22:28.253Z
2014-02-26T17:22:28.253Z
Chad Brewbaker
<p>I would like to know if there are any free graph libraries for testing whether a specific set of minors exists in a given graph?</p>

CC BY-SA 3.0
2014-02-23T18:26:49.883Z
I wish ! that would be an excellent ALENEX/SEA paper or set of papers.
Suresh Venkat
<graph-algorithms><implementation><graph-minor>
A good Library for testing whether a minors exists in a graph?
Hooman
# A good Library for testing whether a minors exists in a graph?

(Asked by: username_0 on 2014-02-23)

I would like to know if there are any free graph libraries for testing whether a specific set of minors exists in a given graph?

**Tags:** graph-algorithms, implementation, graph-minor

> **Comments:**
> **username_1**: I wish ! that would be an excellent ALENEX/SEA paper or set of papers.  

---

## 1 answers

### Answer by username_2 on 2014-02-26. Score: 5

[NAUTY](http://cs.anu.edu.au/~bdm/nauty/) can be used as a library to help you build a hashtable for the entire poset of graph minors for small $n$. The key would be the cannonial form given by NAUTY and the value would be a concatenation in sorted order of the cannonical forms of it's direct minors.

> **Comments:**
> **username_3**: Yes, but nauty doesn't (as far as I know) provide any methods for *finding minors in the first place*. Also, given that the question was about merely the presence/absence of a specific set of minors, I don't see how building a hashtable out of all instances helps solve that initial problem...  
> **username_2**: Wendy Myrvold and Brendan McKay do a lot of graph minor research with NAUTY as a support library. DFS on deletions/joins until you get down to a tractable number of vertices then query the pre-computed poset. How you do the DFS will depend on what type of minor you are looking for.  
> **username_3**: Interesting! You should make that part of the answer. Also, can you give a reference? I couldn't find it.  

---

