Concept

Mineur (théorie des graphes)

Publications associées (143)

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

How to learn a graph from smooth signals

Vasilis Kalofolias

We propose a framework that learns the graph structure underlying a set of smooth signals. Given a real m by n matrix X whose rows reside on the vertices of an unknown graph, we learn the edge weights w under the smoothness assumption that trace(X^TLX) is ...

2016

Disjoint edges in topological graphs and the tangled-thrackle conjecture

Andres Jacinto Ruiz Vargas

It is shown that fora constant t is an element of N, every simple topological graph on n vertices has 0(n) edges if the graph has no two sets of t edges such that every edge in one set is disjoint from all edges of the other set (i.e., the complement of th ...

Academic Press Ltd- Elsevier Science Ltd2016

Distributed Graph-Based Control of Convoys of Heterogeneous Vehicles using Curvilinear Road Coordinates

Alcherio Martinoli, Milos Vasic, Inaki Navarro Oiza, Florian Zimmermann

This paper investigates the problem of controlling a heterogeneous group of vehicles with the aim of forming multi-lane convoys. We use a distributed, graph-based control law, implemented in a longitudinal coordinate system parallel to the road. Each vehic ...

Ieee2016

Scaling a Reliable Distributed System

Alexandre David Olivier Maurer

We consider the problem of reliably connecting an arbitrarily large set of computers (nodes) with communication channels. Reliability means here the ability, for any two nodes, to remain connected (i.e., their ability to communicate) with probability at le ...

LPD EPFL2016

Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering

Pierre Vandergheynst, Xavier Bresson, Michaël Defferrard

In this work, we are interested in generalizing convolutional neural networks (CNNs) from low-dimensional regular grids, where image, video and speech are represented, to high-dimensional irregular domains, such as social networks, brain connectomes or wor ...

2016

Consistency of Cheeger and Ratio Graph Cuts

Xavier Bresson

This paper establishes the consistency of a family of graph-cut-based algorithms for clustering of data clouds. We consider point clouds obtained as samples of a ground-truth measure. We investigate approaches to clustering based on minimizing objective fu ...

Microtome Publ2016

Low-Rank Matrices on Graphs: Generalized Recovery & Applications

Pierre Vandergheynst, Nathanaël Perraudin, Nauman Shahid

Many real world datasets subsume a linear or non-linear low-rank structure in a very low-dimensional space. Unfortunately, one often has very little or no information about the geometry of the space, resulting in a highly under-determined recovery problem. ...

2016

Graph Signal Processing

Ntorina Thanou

Over the past few decades we have been experiencing an explosion of information generated by large networks of sensors and other data sources. Much of this data is intrinsically structured, such as traffic evolution in a transportation network, temperature ...

EPFL2016

From data to structures

Vasilis Kalofolias

Weighted undirected graphs are a simple, yet powerful way to encode structure in data. A first question we need to address regarding such graphs is how to use them effectively to enhance machine learning problems. A second but more important question is ho ...

EPFL2016

Assembling a Network out of Ambiguous Patches

Matthias Grossglauser, Lyudmila Yartseva, Jefferson Elbert Simões

Many graph mining and network analysis problems rely on the availability of the full network over a set of nodes. But inferring a full network is sometimes non-trivial if the raw data is in the form of many small {\em patches} or subgraphs, of the true net ...

2016