A graph G is a quasi-line graph if for every vertex v, the set of neighbors of v can be expressed as the union of two cliques. The class of quasi-line graphs is a proper superset ...
The set R of relevant cycles of a graph G is the union of its minimum cycle bases. We introduce a partition of R such that each cycle in a class W can be expressed as a sum of oth...
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
—We propose a broadcast protocol that is based on a form of cooperative transmission called the Opportunistic Large Array (OLA). Multiple SNR (or transmission) thresholds are use...
: For a large class of bounded-error estimation problems, the posterior feasible set 5 for the parameters can be dened by nonlinear inequalities. The set-inversion approach combine...