Let G be a tree and let H be a collection of subgraphs of G, each having at most d connected components. Let (H) denote the maximum number of members of H no two of which share a ...
The power system monitoring problem asks for as few as possible measurement devices to be put in an electric power system. The problem has a graph theory model involving power dom...
Paul Dorbec, Michel Mollard, Sandi Klavzar, Simon ...
Motivated by issues in machine learning and statistical pattern classification, we investigate a class cover problem (CCP) with an associated family of directed graphs--class cove...
An N-superconcentrator is a directed, acyclic graph with N input nodes and N output nodes such that every subset of the inputs and every subset of the outputs of same cardinality ...
Graph clustering has generally concerned itself with clustering undirected graphs; however the graphs from a number of important domains are essentially directed, e.g. networks of...