Concept

Minimum spanning tree

Related publications (211)

Monochromatic cycle covers in random graphs

A classic result of Erdos, Gyarfas and Pyber states that for every coloring of the edges of K-n with r colors, there is a cover of its vertex set by at most f(r)=O(r2logr) vertex-disjoint monochromatic cycles. In particular, the minimum number of such cove ...

WILEY2018

Robust Distributed Control Beyond Quadratic Invariance

Maryam Kamgarpour, Luca Furieri

The problem of robust distributed control arises in several large-scale systems, such as transportation networks and power grid systems. In many practical scenarios controllers might not have enough information to make globally optimal decisions in a tract ...

IEEE2018

Decentralized clustering for node-variant graph filtering with graph diffusion LMS

Ali H. Sayed, Roula Nassif

In this work, we consider the problem of estimating the coefficients of linear shift-invariant FIR graph filters. We assume hybrid node-varying graph filters where the network is decomposed into clusters of nodes and, within each cluster, all nodes have th ...

IEEE2018

Experimental repetitions and blockage of large stems at ogee crested spillways with piers

Anton Schleiss, Michael Pfister, José Pedro Gamito de Saldanha Calado Matos, Paloma Furlan

Large wood is often transported by rivers into reservoirs during heavy rainfall events. When a critical section like a spillway is blocked and discharge capacity reduced, an uncontrolled increase of the reservoir water level may occur. This study aims to s ...

2018

Optimal Distribution of Active Modules in Modular Robots

Jamie Paik, Christoph Heinrich Belke, Meibao Yao

Reconfigurability in versatile systems of modular robots is achieved by appropriate actuation of their modular units. Optimized distribution of active modules in the modular architecture can significantly reduce cost and energy in the reconfiguration tasks ...

2018

A metacommunity model for the spread of proliferative kidney disease in stream networks

Andrea Rinaldo, Enrico Bertuzzo, Lorenzo Mari, Luca Carraro, Marino Gatto

Proliferative kidney disease (PKD) affects freshwater salmonid populations in temperate European and North-American rivers. It is caused by the endoparasitic myxozoan Tetracapsuloides bryosalmonae, which exploits freshwater bryozoans as intermediate hosts. ...

2017

Busy Man’s Synthesis: Combinational Delay Optimization With SAT

Giovanni De Micheli, Mathias Soeken

Boolean SAT solving can be used to find a minimum- size logic network for a given small Boolean function. This paper extends the SAT formulation to find a minimum-size network under delay constraints. Delay constraints are given in terms of input arrival t ...

Ieee2017

Semi-automatic 3D morphological reconstruction of neurons with densely branching morphology: Application to retinal All amacrine cells imaged with multi -photon excitation microscopy

Bas-Jan Zandt

Background: Accurate reconstruction of the morphology of single neurons is important for morphometric studies and for developing compartmental models. However, manual morphological reconstruction can be extremely time-consuming and error-prone and algorith ...

Elsevier2017

Cooperative Data Exchange with Weighted Cost based on d-Basis Construction

Michael Christoph Gastpar, Su Li, Abhin Shah

We consider the cooperative data exchange problem, in which nodes are fully connected with each other. Each node initially only has a subset of the K packets making up a file and wants to recover the whole file. Node i can make a broadcast transmission, wh ...

2017

Multi-level Logic Benchmarks: An Exactness Study

Giovanni De Micheli, Mathias Soeken, Pierre-Emmanuel Julien Marc Gaillardon, Luca Gaetano Amarù, Eleonora Testa, Winston Jason Haaswijk

In this paper, we study exact multi-level logic benchmarks. We refer to an exact logic benchmark, or exact benchmark in short, as the optimal implementation of a given Boolean function, in terms of minimum number of logic levels and/or nodes. Exact benchma ...

Ieee2017

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.