An arc of a graph is an oriented edge and a 3-arc is a 4-tuple (v, u, x, y) of vertices such that both (v, u, x) and (u, x, y) are paths of length two. The 3-arc graph of a given ...
LQGraph implements methods for optimizing the connectivity of sites administered to protect biodiversity (a conservation area network). The methods are suitable for existing prote...
When a physicist performs a quantic measurement, new information about the system at hand is gathered. This presentation studies the logical properties of how this new information...
A 3-connected matroid M is sequential or has path width 3 if its ground set E(M) has a sequential ordering, that is, an ordering (e1, e2, . . . , en) such that ({e1, e2, . . . , ek...
In this paper we study connectivity in wireless ad-hoc networks by modeling the network as an undirected geometric random graph. The novel aspect in our study is that for finding t...