29 citations · 98 across the 20 of their papers we have counts for
4 papers · 1 filter
Algebraic constructions of efficient broadcast networks
Michael J. Dinneen, Vance Faber, Michael R. Fellows
Cayley graph techniques are introduced for the problem of constructing networks having the maximum possible number of nodes, among networks that satisfy prescribed bounds on the pa…
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…
Algorithms for learning and teaching sets of vertices in graphs
Lane H. Clark, Patricia A. Evans, Michael R. Fellows +1
The learning complexity of special sets of vertices in graphs is studied in the model(s) of exact learning by (extended) equivalence and membership queries. Polynomial-time learnin…
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…