This paper proposes a method for reducing the maximum degree of vertices in graphs that maintain optimal broadcast time when a vertex can call a vertex at distance at most k durin...
Feature interaction detection in the context of systems that are highly integrated into their environment, such as embedded or software-intensive systems, is different from classi...
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...