Publications related to A full characterization of invariant embeddability of unimodular planar graphs

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.

Independence number of generalized Petersen graphs

Javad Ebrahimi Boroojeni

Determining the size of a maximum independent set of a graph G, denoted by alpha(G), is an NP-hard problem. Therefore many attempts are made to find upper and lower bounds, or exact values of alpha(G) for special classes of graphs. This paper is aimed towa ...

Charles Babbage Res Ctr2016

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

Tracking Time-Vertex Propagation using Dynamic Graph Wavelets

Nathanaël Perraudin, Benjamin Ricaud, Francesco Grassi

Graph Signal Processing generalizes classical signal processing to signal or data indexed by the vertices of a weighted graph. So far, the research efforts have been focused on static graph signals. However numerous applications involve graph signals evolv ...

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

Principal Patterns on Graphs: Discovering Coherent Structures in Datasets

Pierre Vandergheynst, Kirell Maël Benzi, Benjamin Ricaud

Graphs are now ubiquitous in almost every field of research. Recently, new research areas devoted to the analysis of graphs and data associated to their vertices have emerged. Focusing on dynamical processes, we propose a fast, robust and scalable framewor ...

Ieee-Inst Electrical Electronics Engineers Inc2016

Signal-Adapted Tight Frames on Graphs

Dimitri Nestor Alice Van De Ville, Hamid Behjat

The analysis of signals on complex topologies modeled by graphs is a topic of increasing importance. Decompositions play a crucial role in the representation and processing of such information. Here, we propose a new tight frame design that is adapted to a ...

Institute of Electrical and Electronics Engineers2016

Source Localization on Graphs via l1 Recovery and Spectral Graph Theory

Pierre Vandergheynst, Xavier Bresson, Rodrigo Cerqueira Gonzalez Pena

We cast the problem of source localization on graphs as the simultaneous problem of sparse recovery and diffusion ker- nel learning. An l1 regularization term enforces the sparsity constraint while we recover the sources of diffusion from a single snapshot ...

Ieee2016

Infectious Disease Containment Based on a Wireless Sensor System

Marcel Salathé, Xiao Sun

Infectious diseases pose a serious threat to public health due to its high infectivity and potentially high mortality. One of the most effective ways to protect people from being infected by these diseases is through vaccination. However, due to various re ...

Ieee-Inst Electrical Electronics Engineers Inc2016

Graph-based compression of dynamic 3D point cloud sequences

Pascal Frossard

This paper addresses the problem of compression of 3D point cloud sequences that are characterized by moving 3D positions and color attributes. As temporally successive point cloud frames are similar, motion estimation is key to effective compression of th ...

Institute of Electrical and Electronics Engineers2016

A full characterization of invariant embeddability of unimodular planar graphs

Graph Chatbot

Chat with Graph Search

Independence number of generalized Petersen graphs

Scaling a Reliable Distributed System

Tracking Time-Vertex Propagation using Dynamic Graph Wavelets

Disjoint edges in topological graphs and the tangled-thrackle conjecture

Simple topological graphs

Principal Patterns on Graphs: Discovering Coherent Structures in Datasets

Signal-Adapted Tight Frames on Graphs

Source Localization on Graphs via l1 Recovery and Spectral Graph Theory

Infectious Disease Containment Based on a Wireless Sensor System

Graph-based compression of dynamic 3D point cloud sequences

Tracking Time-Vertex Propagation using Dynamic Graph Wavelets

Signal-Adapted Tight Frames on Graphs

Simple topological graphs

Source Localization on Graphs via l1 Recovery and Spectral Graph Theory

Disjoint edges in topological graphs and the tangled-thrackle conjecture

Independence number of generalized Petersen graphs

Infectious Disease Containment Based on a Wireless Sensor System

Graph-based compression of dynamic 3D point cloud sequences

Scaling a Reliable Distributed System

Principal Patterns on Graphs: Discovering Coherent Structures in Datasets