1 citations · 1 across the 1 of their papers we have counts for
1 paper
Christopher Knapp, Steven Noble
We consider the Tutte polynomial of three classes of greedoids: those arising from rooted graphs, rooted digraphs and binary matrices. We establish the computational complexity of…