Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Dégénérescence (théorie des graphes)

Publications associées (24)

Saturated simple and k-simple topological graphs

János Pach, Jan Kyncl

A simple topological graph G is a graph drawn in the plane so that any pair of edges have at most one point in common, which is either an endpoint or a proper crossing. G is called saturated if no further edge can be added without violating this condition. ...

Elsevier Science Bv2015

Bootstrap Percolation in Power-Law Random Graphs

Léo Hamed Amini

A bootstrap percolation process on a graph is an "infection" process which evolves in rounds. Initially, there is a subset of infected nodes and in each subsequent round each uninfected node which has at least infected neighbours becomes infected and remai ...

Springer2014

On the Sparsity of Wavelet Coefficients for Signals on Graphs

Pierre Vandergheynst, Benjamin Ricaud, David Shuman

A number of new localized, multiscale transforms have recently been introduced to analyze data residing on weighted graphs. In signal processing tasks such as regularization and compression, much of the power of classical wavelets on the real line is deriv ...

Spie-Int Soc Optical Engineering2013

On the insulator-conductor transition in polymer nanocomposites

Gianluca Ambrosetti

This thesis presents an investigation of the models describing electrical conductivity in polymer nanocomposites, which consist in more or less random dispersions of nanometric conductive fillers like carbon nanotubes, nanofibers or graphene sheets in a po ...

EPFL2010