Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wishes to partition G into connected components by del...
We consider a product X of n finite intervals of integers, a map F from X to itself, the asynchronous state transition graph (F) on X that Thomas proposed as a model for the dynam...
A star forest of a graph G is a spanning subgraph of G in which each component is a star. The minimum number of edges required to guarantee that an arbitrary graph, or a bipartite...
Sheila Ferneyhough, Ruth Haas, Denis Hanson, Gary ...
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic,...
Abstract— Today, due to the vast amount of literature on largescale wireless networks, we have a fair understanding of the asymptotic behavior of such networks. However, in real ...