Concept

Component (graph theory)

Publications associées (142)

A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants)

We introduce a family of reductions for removing proper and homogeneous pairs of cliques from a graph G. This family generalizes some routines presented in the literature, mostly in the context of claw-free graphs. These reductions can be embedded in a sim ...

2011

Boundary mixing in lakes: 2. Combined effects of shear- and convectively induced turbulence on basin-scale mixing

Alfred Johny Wüest

A detailed comparison of results from a numerical three-dimensional hydrostatic lake model with high-resolution observations of the vertical structure of the turbulent bottom boundary layer (BBL) in a medium-size lake (Lake Alpnach, Switzerland) is provide ...

Amer Geophysical Union2011

MARGIN: Maximal frequent subgraph mining

Ramachandra Satyanarayana Valluri

The exponential number of possible subgraphs makes the problem of frequent subgraph mining a challenge. The set of maximal frequent subgraphs is much smaller to that of the set of frequent subgraphs providing ample scope for pruning. MARGIN is a maximal su ...

2010

Local Graph-based Distributed Control for Safe Highway Platooning

Alcherio Martinoli, Sven Adrian Gowal, Riccardo Falconi

Using graph theory, this paper investigates how a group of vehicles, endowed with local positioning capabilities (range and bearing to other vehicles), can keep a predefined formation. We propose a longitudinal and lateral controller that stabilizes a syst ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010

Graph based distributed control of non-holonomic vehicles endowed with local positioning information engaged in escorting missions

Alcherio Martinoli, Sven Adrian Gowal, Riccardo Falconi

Using graph theory, this paper investigates how a group of robots, endowed with local positioning (range and bearing from other robots), can be engaged in a leader- following mission whilst keeping a predefined configuration. The possibility to locally cha ...

IEEE2010

Decomposition of Geometric Set Systems and Graphs

We study two decomposition problems in combinatorial geometry. The first part of the thesis deals with the decomposition of multiple coverings of the plane. We say that a planar set is cover-decomposable if there is a constant m such that any m-fold coveri ...

EPFL2010

Compositional verification for component-based systems and application

Joseph Sifakis

The authors present a compositional method for the verification of component-based systems described in a subset of the behaviour-interaction- priority language encompassing multi-party interaction without data transfer. The method is based on the use of t ...

2010

The Coherence of Theories-Dependencies and Weights

Jingshi Li

One way to evaluate and compare rival but potentially incompatible theories that account for the same set of observations is coherence. In this paper we take the quantitative notion of theory coherence as proposed by [Kwok, et.al. 98] and broaden its found ...

2009

Graph-Based Distributed Control for Non-holonomic Vehicles Engaged in a Reconfiguration Task using Local Positioning Information

Alcherio Martinoli, Sven Adrian Gowal, Riccardo Falconi

Formation building and keeping among vehicles has been studied for many years, since 1987 with Reynold's rules. This paper presents a control algorithm, based on recent work in graph theory, able to reconfigure static formations of non-holonomic vehicles e ...

2009

Partitioning graphs into complete and empty graphs

Tinaz Ekim

Given integers j and k and a graph G, we consider partitions of the vertex set of G into j + k parts where j of these parts induce empty graphs and the remaining k induce cliques. If such a partition exists, we say G is a (j, k)-graph. For a fixed j and k ...

2009

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search