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.
A path graph is the intersection graph of subpaths of a tree. In 1970, Renz asked for a characterization of path graphs by forbidden induced subgraphs. We answer this question by determining the complete list of graphs that are not path graphs and are mini ...
The Hamiltonian structures of several hybrid kinetic-fluid models are identified explicitly, upon considering collisionless Vlasov dynamics for the hot particles interacting with a bulk fluid. After presenting different pressure-coupling schemes for an ord ...
Let n >= 4 be even. It is shown that every set S of n points in the plane can be connected by a (possibly self-intersecting) spanning tour (Hamiltonian cycle) consisting of n straight-line edges such that the angle between any two consecutive edges is at m ...
Observational data usually comes with a multimodal nature, which means that it can be naturally represented by a multi-layer graph whose layers share the same set of vertices (users) with different edges (pairwise relationships). In this paper, we address ...
Institute of Electrical and Electronics Engineers2012
The most classic approach to the dynamics of an n-dimensional mechanical system constrained by d independent holonomic constraints is to pick explicitly a new set of (n - d) curvilinear coordinatesparametrizingthe manifold of configurations satisfying the ...
We study the thermodynamics of cubic Ti1-xAlxN using a unified cluster expansion approach for the alloy problem. The purely configurational part of the alloy Hamiltonian is expanded in terms of concentration- and volume-dependent effective cluster interact ...
This paper presents a methodology that use volunteered geographic information (VGI), cyclist GPS tracking and Open Street Map network, with network based kernel density estimation. It investigates optimal location for cycle paths and lanes development. Rec ...
We consider an elastic chain at thermodynamic equilibrium with a heat bath, and derive an approximation to the probability density function, or pdf, governing the relative location and orientation of the two ends of the chain. Our motivation is to exploit ...
The goal of this paper is to derive the Hamiltonian structure of polarized and magnetized Euler-Maxwell fluids by reduction of the canonical symplectic form on phase space, and to generalize the dynamics to the nonabelian case. The Hamiltonian function we ...
We introduce an incremental cooperation mode into the framework of adaptive networks (AN). The method applies to generic topologies and avoids the need to establish a Hamiltonian cycle over the network, generalizing the original incremental mode, while kee ...
