29 citations · 98 across the 20 of their papers we have counts for
Showing 1995 · math.COShow all
2 papers · 2 filters
math.CO1995★ 4 cited
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…
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…