84 citations · 228 across the 17 of their papers we have counts for
Showing 1994Show all
2 papers · 1 filter
math.CO1994★ 10 cited
The complexity of broadcasting in bounded-degree networks
Michael J. Dinneen
Broadcasting concerns the dissemination of a message originating at one node of a network to all other nodes. This task is accomplished by placing a series of calls over the commun…
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…