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.
For a given graph G(V,E) and a given vector (......) the problem of finding a hyperplane which separates x form the polyhedron P of the matching matroid on G or proving that x belongs to P is solved by finding a minimum capacity cut on an auxiliary digraph ...
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. ...
The success of the P2P idea has created a huge diversity of approaches, among which overlay networks, for example, Gnutella, Kazaa, Chord, Pastry, Tapestry, P-Grid, or DKS, have received specificc attention from both developers and researchers. A wide vari ...
The fine structures of multiplets in 2-dimensional correlation spectra arise from coherence transfer processes that can be rationalized in terms of connectivity diagrams. These can be derived from conventional energy-level diagrams, which in turn reflect t ...
Let G=(V,E) be connected undirected graph and N a subset of distinguished nodes, called terminals. A Steiner tree on [G,N] is a minimal tree connecting all the terminal nodes. Restricting the instances to the case /N/=/N/-1, we present an algorithm to cons ...
The motivation to this research is the study of the optimal stopping problem for multiparameter processes : given a random process depending on finitely many parameters t = (t1,…,tn), which if stopped at point t in the parameter set produces a reward Xt, w ...
Formation building and keeping among vehicles has been studied for many years, since 1987 with Reynolds' rules [1]. This paper presents a control algorithm, based on recent work in graph theory, able to reconfigure static formations of non-holonomic vehicl ...
We present O(log log n)-round algorithms in the Massively Parallel Computation (MPC) model, with a(n) memory per machine, that compute a maximal independent set, a 1 + epsilon approximation of maximum matching, and a 2 + epsilon approximation of minimum ve ...