5 citations · 7 across the 5 of their papers we have counts for
1 paper · 1 filter
Rebecca Robinson, Graham Farr
The topological containment problem is known to be polynomial-time solvable for any fixed pattern graph H, but good characterisations have been found for only a handful of non-tr…