Publications associées à Line graph

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.

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

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

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

On the energy benefit of compute-and-forward for multiple unicasts

Michael Christoph Gastpar, Jasper Goseling

Compute-and-forward (CF) is a technique which exploits broadcast and superposition in wireless networks. In this paper, the CF energy benefit is studied for networks with unicast sessions and modeled by connected graphs. This benefit is defined as the rati ...

Ieee2016

A Multiscale Pyramid Transform for Graph Signals

Pierre Vandergheynst, David Shuman, Mohammadjavad Faraji

Multiscale transforms designed to process analog and discrete-time signals and images cannot be directly applied to analyze high-dimensional data residing on the vertices of a weighted graph, as they do not capture the intrinsic topology of the graph data ...

Institute of Electrical and Electronics Engineers2016

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

On the Zarankiewicz problem for intersection hypergraphs

János Pach

Let d and t be fixed positive integers, and let denote the complete d-partite hypergraph with t vertices in each of its parts, whose hyperedges are the d-tuples of the vertex set with precisely one element from each part. According to a fundamental theorem ...

Academic Press Inc Elsevier Science2016

Towards stationary time-vertex signal processing

Pierre Vandergheynst, Nathanaël Perraudin, Andreas Loukas, Francesco Grassi

Graph-based methods for signal processing have shown promise for the analysis of data exhibiting irregular structure, such as those found in social, transportation, and sensor networks. Yet, though these systems are often dynamic, state-of-the-art methods ...

2016

Decomposition of Multiple Packings with Subquadratic Union Complexity

János Pach, Bartosz Maria Walczak

Suppose k is a positive integer and X is a k-fold packing of the plane by infinitely many arc-connected compact sets, which means that every point of the plane belongs to at most k sets. Suppose there is a function f(n) = o(n(2)) with the property that any ...

Cambridge Univ Press2016

Line graph

Graph Chatbot

Chattez avec Graph Search

Source Localization on Graphs via l1 Recovery and Spectral Graph Theory

Disjoint edges in topological graphs and the tangled-thrackle conjecture

Signal-Adapted Tight Frames on Graphs

On the energy benefit of compute-and-forward for multiple unicasts

A Multiscale Pyramid Transform for Graph Signals

Low-Rank Matrices on Graphs: Generalized Recovery & Applications

On the Zarankiewicz problem for intersection hypergraphs

Towards stationary time-vertex signal processing

Introducing dynamicity in JavaBIP

Decomposition of Multiple Packings with Subquadratic Union Complexity

Source Localization on Graphs via l1 Recovery and Spectral Graph Theory

Disjoint edges in topological graphs and the tangled-thrackle conjecture

Introducing dynamicity in JavaBIP

On the energy benefit of compute-and-forward for multiple unicasts

Signal-Adapted Tight Frames on Graphs

Decomposition of Multiple Packings with Subquadratic Union Complexity

A Multiscale Pyramid Transform for Graph Signals

Low-Rank Matrices on Graphs: Generalized Recovery & Applications

On the Zarankiewicz problem for intersection hypergraphs

Towards stationary time-vertex signal processing