Concept

Maximal independent set

Publications associées (108)

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

Constrained paths in the flip-graph of regular triangulations

Thomas Liebling, Lionel Pournin

We describe particular paths in the flip-graph of regular triangulations in any dimension. It is shown that any pair of regular triangulations is connected by a path along which none of their common faces are destroyed. As a consequence, we obtain the conn ...

2007

Extended law of corresponding states in short-range square wells: A potential energy landscape study

Giuseppe Foffi, Francesco Sciortino

We study the statistical properties of the potential energy landscape of a system of particles interacting via a very short-range square-well potential (of depth - u0) as a function of the range of attraction Δ to provide thermodynamic insights of the Noro ...

2006

New polynomial-time algorithms for Camion bases

Antoine Musitelli

Let M be a finite set of vectors in Rn of cardinality m and H(M) = {{x ∈ Rn : cTx = 0} : c ∈ M} the central hyperplane arrangement represented by M. An independent subset of M of cardinality n is called a Camion basis, if it determines a simplex region in ...

2006

Information Flow Decomposition for Network Coding

Christina Fragouli, Emina Soljanin

The famous min-cut, max-flow theorem states that a source node can send a commodity through a network to a sink node at the rate determined by the flow of the min-cut separating the source and the sink. Recently it has been shown that by linear re-encoding ...

2006

Information flow decomposiiton for network coding

Christina Fragouli, Emina Soljanin

Institute of Electrical and Electronics Engineers2006

Unified Inference for Variational Bayesian Linear Gaussian State-Space Models

Silvia Chiappa

Linear Gaussian State-Space Models are widely used and a Bayesian treatment of parameters is therefore of considerable interest. The approximate Variational Bayesian method applied to these models is an attractive approach, used successfully in application ...

2006

Unified Inference for Variational Bayesian Linear Gaussian State-Space Models

Silvia Chiappa

IDIAP2006

Electrocatalytic hydrogen evolution by cobalt complexes of macrocyclic imine ligands

Xile Hu

A series of cobalt complexes with macrocyclic imine ligands such as difluoroboryldiglyxomime and [14]-Tetraene-N4 are synthesized for electrochem. hydrogen evolution catalysis. The complexes catalyze the redn. of proton to dihydrogen at potentials in the r ...

2006

Polar cographs

Dominique de Werra, Tinaz Ekim

Polar graphs are a natural extension of some classes of graphs like bipartite graphs, split graphs and complements of bipartite graphs. A graph is (s,k)-polar if there exists a partition A,B of its vertex set such that A induces a complete s-partite graph ...

2005

Circular Ones Matrices and the Stable set Polytopes of Quasi-Line Graphs

Friedrich Eisenbrand, Gautier Stauffer

It is a long standing open problem to find an explicit description of the stable set polytope of claw-free graphs. Yet more than 20 years after the discovery of a polynomial algorithm for the maximum stable set problem for claw-free graphs, there is even n ...

2005