Concept

Théorème flot-max/coupe-min

Publications associées (106)

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

Estimating MFDs in simple networks with route choice

Nikolaos Geroliminis

The concept of the Macroscopic Fundamental Diagram (MFD) is elegant and attractive because it provides a global view of traffic behavior and performance at a network level. However, recent research shows that the MFD shape can be influenced by local traffi ...

Elsevier2013

Iterative Coding for Network Coding

Rüdiger Urbanke, Andrea Montanari

We consider communication over a noisy network under randomized linear network coding. Possible error mechanisms include node-or link-failures, Byzantine behavior of nodes, or an overestimate of the network min-cut. Building on the work of Kotter and Kschi ...

Ieee-Inst Electrical Electronics Engineers Inc2013

Combinatorial algorithms for wireless information flow

Christina Fragouli, Javad Ebrahimi Boroojeni

long-standing open question in information theory is to characterize the unicast capacity of a wireless relay network. The difficulty arises due to the complex signal interactions induced in the network, since the wireless channel inherently broadcasts the ...

Assoc Computing Machinery2012

Properties of Network Polynomials

Christina Fragouli, Javad Ebrahimi Boroojeni

It is well known that transfer polynomials play an important role in the network code design problem. In this paper we provide a graph theoretical description of the terms of such polynomials. We consider acyclic networks with arbitrary number of receivers ...

2012

Properties of Network Polynomials

Javad Ebrahimi Boroojeni

Ieee2012

The effect of variability of urban systems characteristics in the network capacity

Nikolaos Geroliminis, Burak Boyaci

Recent experimental analysis has shown that some types of urban networks exhibit a low scatter reproducible relationship between average network flow and density, known as the macroscopic fundamental diagram (MFD). It has also been shown that heterogeneity ...

Elsevier2012

Experimental validation of edge strength model for glass with polished and cut edge finishing

Pieter Christian Louter

In literature, the experimental validation of a glass edge strength model is lacking. Therefore, in this study, an edge strength model was established and validated. The short-term parameters of the edge strength model, i.e. the flaw geometry and depth, we ...

Elsevier2012

Atmospheric Turbulence Effects on Wind-Turbine Wakes: An LES Study

Fernando Porté Agel, Yu-Ting Wu

A numerical study of atmospheric turbulence effects on wind-turbine wakes is presented. Large-eddy simulations of neutrally-stratified atmospheric boundary layer flows through stand-alone wind turbines were performed over homogeneous flat surfaces with fou ...

Mdpi Ag2012

Energy-Proportional and Scalable Networks

Nedeljko Vasic

The power consumption of the Internet and datacenter networks is already significant due to a large degree of redundancy and high idle power consumption of the network elements. Therefore, dynamically matching network resources to the actual load is highly ...

EPFL2011

On the connectivity of visibility graphs

The visibility graph of a finite set of points in the plane has the points as vertices and an edge between two vertices if the line segment between them contains no other points. This paper establishes bounds on the edge- and vertex-connectivity of visibil ...

2011