In this paper we present an algorithm to generate all minimal 3-vertex connected spanning subgraphs of an undirected graph with n vertices and m edges in incremental polynomial tim...
Endre Boros, Konrad Borys, Vladimir Gurvich, G&aac...
In this paper we study some connectivity augmentation problems. Given a connected graph G with some desirable property, we want to make G 2-vertex connected (or 2-edge connected) ...
One of the key strengths of the region connection calculus (RCC) -- its generality -- is also one of its most important drawbacks for practical applications. The semantics of all ...
Steven Schockaert, Martine De Cock, Chris Cornelis...
Classically, connectivity is a topological notion for sets, often introduced by means of arcs. A non topological axiomatics has been proposed by Matheron and Serra. The present pa...
Abstract. Diffusion magnetic resonance imaging has led to active research in the analysis of anatomical connectivity in the brain. Many approaches have been proposed to model the ...