Publications associées à Graphe chenille

Manycore clique enumeration with fast set intersections

Paolo Ienne, Radu Ioan Stoica, Kubilay Atasu, Jovan Blanusa

Listing all maximal cliques of a given graph has important applications in the analysis of social and biological networks. Parallelisation of maximal clique enumeration (MCE) algorithms on modern manycore processors is challenging due to the task-level par ...

ACM2020

Using the Green's function to simplify and understand dendrites

Willem Anna Mark Wybo

Neurons are endowed with dendrites: tree-like structures that collect and transform inputs. These arborizations are believed to substantially enhance the computational repertoire of neurons. While it has long been known that dendrites are not iso-potential ...

EPFL2017

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

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

Outerplanar graph drawings with few slopes

Bartosz Maria Walczak

We consider straight-line outerplanar drawings of outerplanar graphs in which a small number of distinct edge slopes are used, that is, the segments representing edges are parallel to a small number of directions. We prove that Delta - 1 edge slopes suffic ...

Elsevier Science Bv2014

Orthogeodesic Point-Set Embedding of Trees

Radoslav Fulek, Fabrizio Frati

Let S be a set of N grid points in the plane, no two of which lie on the same horizontal or vertical line, and let G be a graph with n vertices (n

Elsevier Science Bv2011