Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
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 ...
We present a simple constructive heuristic for the optimal enclosed area polygon problem. Namely, given a finite set S of points in the plane, we look for the simple polygon with vertex set S having minimal, respectively maximal, enclosed area. ...
We derive inverse trace inequalities for hp-finite elements. Utilizing orthogonal polynomials, we show how to derive explicit expressions for the constants when considering triangular and tetrahedral elements. We also discuss how to generalize this techniq ...
Stabilized finite elements on strongly anisotropic meshes are considered. The design of the stability coefficients is addressed for both the advection-diffusion and the Stokes problems when using continuous piecewise linear finite elements on triangles. Us ...
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 ...
This contribution presents an ongoing study focused on how location awareness feature modifies collaboration in the context of mobile computing. First it describes the environment we designed and implemented in the form of a mobile game called CatchBob!. T ...
The common point between the different chapters of the present work is graph theory. We investigate some well known graph theory problems, and some which arise from more specific applications. In the first chapter, we deal with the maximum stable set probl ...
