Sven Somme 1904-1961

Somme Coloration De Graphe

RÉSUMÉ : Dans cet article nous étudions le problème de la somme coloration minimale (MSCP) qui consiste à trouver une coloration des sommets d’un graphe, utilisant des entiers naturels, telle que la somme des couleurs est minimale. Nous présentons une synthèse des travaux sur MSCP, ainsi qu’une nouvelle famille d’algorithmes gloutons pour MSCP. Nous proposons une étude de bornes inférieures bas...

Local Density Sven

We survey computational approaches and solutions for discovering locally dense groups in social and complex networks. A graph-theoretical property is local if it is definable over subgraphs induced by the groups only. In this context, we discuss perfectly dense groups (cliques), structurally dense groups (plexes, cores), and statistically dense groups (η-dense groups). We give algorithms (and h...

Memorial: Sven-Ivar Seldinger

Somme Ponctuelle D’opérateurs Maximaux Monotones

The primary goal of this paper is to shed some light on the maximality of the pointwise sum of two maximal monotone operators. The interesting purpose is to extend some recent results of Attouch, Moudafi and Riahi on the graphconvergence of maximal monotone operators to the more general setting of reflexive Banach spaces. In addition, we present some conditions which imply the uniform Brézis-Cr...

SVEn - Shared Virtual Environment

This paper presents a system for a shared virtual experience which was developed within a student project. The main idea is to have two or more persons at different locations, who can interact with each other in the same virtual environment. In order to realize this idea every person is motion-captured and wears a head-mounted display (HMD). The virtual environment is rendered with the Unity ga...