Minimizing the number of add-drop multiplexers (ADMs) in a unidirectional SONET ring can be formulated as a graph decomposition problem. When traffic requirements are uniform and ...
Charles J. Colbourn, Gaetano Quattrocchi, Violet R...
We investigate the role of the information available to the players on the outcome of the cops and robbers game. This game takes place on a graph and players move along the edges ...
Graphical structures such as Bayesian networks or Markov networks are very useful tools for representing irrelevance or independency relationships, and they may be used to e cientl...
Much of the data generated and analyzed in the life sciences can be interpreted and represented by networks or graphs. Network analysis and visualization methods help in investigat...
Mario Albrecht, Andreas Kerren, Karsten Klein, Oli...
This paper presents a combined pointer and escape analysis algorithm for Java programs. The algorithm is based on the abstraction of points-to escape graphs, which characterize ho...