4 citations · 4 across the 2 of their papers we have counts for
2 papers
math.CO1995★ 4 cited
Obstructions to within a few vertices or edges of acyclic
Kevin Cattell, Michael J. Dinneen, Michael R. Fellows
Finite obstruction sets for lower ideals in the minor order are guaranteed to exist by the Graph Minor Theorem. It has been known for several years that, in principle, obstruction…
math.CO1994
A simple linear-time algorithm for finding path-decompositions of small width
Kevin Cattell, Michael J. Dinneen, Michael R. Fellows
We described a simple algorithm running in linear time for each fixed constant , that either establishes that the pathwidth of a graph is greater than , or finds a path-d…