Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
In this article we study capacitated network design problems. We unify and extend polyhedral results for directed, bidirected and undirected link capacity models. Based on valid i...
Christian Raack, Arie M. C. A. Koster, Sebastian O...
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
A module of an undirected graph is a set X of nodes such for each node x not in X , either every member of X is adjacent to x, or no member of X is adjacent to x. There is a canon...
We present a class of graphical models for directly representing the joint cumulative distribution function (CDF) of many random variables, called cumulative distribution networks...