Concept

Spanning tree

Related publications (82)

Graph Chatbot

Chat with Graph Search

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.

Exponential extinction time of the contact process on finite graphs

Thomas Mountford, Daniel Rodrigues Valesin, Jean-Christophe Mourrat

We study the extinction time tau of the contact process started with full occupancy on finite trees of bounded degree. We show that, if the infection rate is larger than the critical rate for the contact process on Z, then, uniformly over all trees of degr ...

Elsevier Science Bv2016

Fixed-wing drones for communication networks

Maja Varga

In the last decade, drones became frequently used to provide eye-in-the-sky overview in the outdoor environment. Their main advantage compared to the other types of robots is that they can fly above obstacles and rough terrains and they can quickly cover l ...

EPFL2016

Downsampling of Signals on Graphs Via Maximum Spanning Trees

Quy Ha Nguyen, Minh Do

Downsampling of signals living on a general weighted graph is not as trivial as of regular signals where we can simply keep every other samples. In this paper we propose a simple, yet effective downsampling scheme in which the underlying graph is approxima ...

Ieee-Inst Electrical Electronics Engineers Inc2015

Budgeted sensor placement for source localization on trees

Patrick Thiran, Laura Elisa Celis, Brunella Marta Spinelli

We address the problem of choosing a fixed number of sensor vertices in a graph in order to detect the source of a partially-observed diffusion process on the graph itself. Building on the definition of double resolvability we introduce a notion of vertex ...

2015

A Sparse Reformulation of the Green's Function Formalism Allows Efficient Simulations of Morphological Neuron Models

Marc-Oliver Gewaltig, Willem Anna Mark Wybo, Benjamin Torben-Nielsen, Daniele Boccalini

We prove that when a class of partial differential equations, generalized from the cable equation, is defined on tree graphs and the inputs are restricted to a spatially discrete, well chosen set of points, the Green's function (GF) formalism can be rewrit ...

Massachusetts Institute of Technology Press2015

Enforcing Efficient Equilibria in Network Design Games via Subsidies

Christos Kalaitzis

The efficient design of networks has been an important engineering task that involves challenging combinatorial optimization problems. Typically, a network designer has to select among several alternatives which links to establish so that the resulting net ...

Springer Verlag2015

Improving Christofides' Algorithm for the s-t Path TSP

Hyung Chan An

We present a deterministic (1+root 5/2)-approximation algorithm for the s-t path TSP for an arbitrary metric. Given a symmetric metric cost on n vertices including two prespecified endpoints, the problem is to find a shortest Hamiltonian path between the t ...

Assoc Computing Machinery2015

Localizing Polygonal Objects in Man-Made Environments

Xiaolu Sun

Object detection is a significant challenge in Computer Vision and has received a lot of attention in the field. One such challenge addressed in this thesis is the detection of polygonal objects, which are prevalent in man-made environments. Shape analysis ...

EPFL2015

Sparse Group Covers and Greedy Tree Approximations

Volkan Cevher, Luca Baldassarre

We consider the problem of finding a K-sparse approximation of a signal, such that the support of the approximation is the union of sets from a given collection, a.k.a. group structure. This problem subsumes the one of finding K-sparse tree approximations. ...

2015

Metapopulation capacity of evolving fluvial landscapes

Andrea Rinaldo, Enrico Bertuzzo

The form of fluvial landscapes is known to attain stationary network configurations that settle in dynamically accessible minima of total energy dissipation by landscape-forming discharges. Recent studies have highlighted the role of the dendritic structur ...

American Geophysical Union2015