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.
Background: Given three signed permutations, an inversion median is a fourth permutation that minimizes the sum of the pairwise inversion distances between it and the three others. This problem is NP-hard as well as hard to approximate. Yet median-based ap ...
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 ...
Extensions and variations of the basic problem of graph coloring are introduced. The problem consists essentially in finding in a graph G a k-coloring, i.e., a partition V-1,...,V-k of the vertex set of G such that, for some specified neighborhood (N) over ...
We consider quasilinear systems of second order elliptic equations on R-N. Using a continuation theorem based on the topological degree for C-1-Fredholm maps, we derive global properties of a maximal connected set of solutions which decay exponentially to ...
The alkali-silica reaction (ASR) is a durability issue of concrete. The amorphous silica of aggregates reacts with the alkalies present in the cement paste pore solution to form a hydrophilic gel which swells in the presence of moisture. Many mass concrete ...
We present the design, correctness, and analysis of SONDe, a simple fully decentralized object deployment algorithm for highly requested systems. Given an object (service or data), SONDe provides a node with a constant upper bound (h) on the number of logi ...
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 grap ...
As an independent complement to previous studies (Weisen et al 2005 Nucl. Fusion 45 L1-4, Weisen et al 2006 Plasma Phys. Control. Fusion 48 A457-66, Angioni et al 2007 Nucl. Fusion 47 1326-35), density peaking in the JET tokamak was investigated on the dat ...
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, ..., k}) to each vertex of G so that no edge has both endpoints with the same color. We propose a new local search methodology, ...
In the last two decades architectural glass has made an enormous leap from a secondary material to a material that combines structural and cladding roles. The structural role is a new and problematic one. In contrast to most other engineering materials the ...