Nash-Williams' arboricity theorem states that a finite graph is the edge-disjoint union of at most k forests if no set of vertices induces more than k( - 1) edges. We prove a...
: The usage of SuperPeers has been proposed to improve the performance of both Structured and Unstructured Peer-to-Peer (P2P) networks. In this paper we explore a network-aware cla...
Abstract. The class of dense circulant graphs of degree four with optimal distance-related properties is analyzed in this paper. An algebraic study of this class is done. Two geome...
Several formalisms have been proposed for qualitative reasoning about regions and their topological relations in space. These formalisms, based on pairwise relations, do not allow...
We describe an extension of B-splines to surfacesof arbitrary topology, including arbitrary boundaries. The technique inherits many of the properties of B-splines: local control, ...