Publications related to Cubic graph

Song Recommendation with Non-Negative Matrix Factorization and Graph Total Variation

Pierre Vandergheynst, Kirell Maël Benzi, Xavier Bresson, Vasilis Kalofolias

This work formulates a novel song recommender system as a matrix completion problem that benefits from collaborative filtering through Non-negative Matrix Factorization (NMF) and content-based filtering via total variation (TV) on graphs. The graphs encode ...

Ieee2016

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

On vertices and facets of combinatorial 2-level polytopes

Yuri Faenza, Manuel Francesco Aprile, Alfonso Bolívar Cevallos Manzano

2-level polytopes naturally appear in several areas of mathematics, including combinatorial optimization, polyhedral combinatorics, communication complexity, and statistics. We investigate upper bounds on the product of the number of facets and the number ...

Springer2016

Removing and Adding Edges for the Traveling Salesman Problem

Ola Nils Anders Svensson

We present a framework for approximating the metric TSP based on a novel use of matchings. Traditionally, matchings have been used to add edges to make a given graph Eulerian, whereas our approach also allows for the removal of certain edges leading to a d ...

Assoc Computing Machinery2016

Synthesis of Homogeneous Manganese-Doped Titanium Oxide Nanotubes from Titanate Precursors

László Forró, Arnaud Magrez, Kurt Schenk, Endre Horvath, Bálint Náfrádi, Rita Smajda, Péter Szirmai, Zlatko Mickovic

We report a novel synthesis route of homogeneously manganese-doped TiO2 nanotubes in a broad concentration range. The scroll-type trititanate (H2Ti3O7) nanotubes prepared by hydrothermal synthesis were used as precursors. Mn2+ ions were introduced by an io ...

Amer Chemical Soc2013

A Bayesian Method for Matching Two Similar Graphs without Seeds

Matthias Grossglauser, Pedram Pedarsani

Approximate graph matching (AGM) refers to the problem of mapping the vertices of two structurally similar graphs, which has applications in social networks, computer vision, chemistry, and biology. Given its computational cost, AGM has mostly been limited ...

2013

Robust Non-Rigid Registration of 2D and 3D Graphs

Pascal Fua, Jan Kybic, Przemyslaw Rafal Glowacki

We present a new approach to matching graphs embedded in R2 or R3. Unlike earlier methods, our approach does not rely on the similarity of local appearance features, does not require an initial alignment, can handle partial matches, and can cope with non-l ...

2012

Clustering with Multi-Layer Graphs: A Spectral Perspective

Pascal Frossard, Pierre Vandergheynst, Xiaowen Dong

Observational data usually comes with a multimodal nature, which means that it can be naturally represented by a multi-layer graph whose layers share the same set of vertices (users) with different edges (pairwise relationships). In this paper, we address ...

Institute of Electrical and Electronics Engineers2012

Learning of Structured Graph Dictionaries

Pascal Frossard, Xiaowen Dong, Xue Zhang

We propose a method for learning dictionaries towards sparse approximation of signals defined on vertices of arbitrary graphs. Dictionaries are expected to describe effectively the main spatial and spectral components of the signals of interest, so that th ...

2012

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.

Cubic graph

Consistency of Cheeger and Ratio Graph Cuts

Song Recommendation with Non-Negative Matrix Factorization and Graph Total Variation

Tracking Time-Vertex Propagation using Dynamic Graph Wavelets

On vertices and facets of combinatorial 2-level polytopes

Removing and Adding Edges for the Traveling Salesman Problem

Synthesis of Homogeneous Manganese-Doped Titanium Oxide Nanotubes from Titanate Precursors

A Bayesian Method for Matching Two Similar Graphs without Seeds

Robust Non-Rigid Registration of 2D and 3D Graphs

Clustering with Multi-Layer Graphs: A Spectral Perspective

Learning of Structured Graph Dictionaries

Graph Chatbot

Chat with Graph Search

Removing and Adding Edges for the Traveling Salesman Problem

Tracking Time-Vertex Propagation using Dynamic Graph Wavelets

Synthesis of Homogeneous Manganese-Doped Titanium Oxide Nanotubes from Titanate Precursors

Song Recommendation with Non-Negative Matrix Factorization and Graph Total Variation

Consistency of Cheeger and Ratio Graph Cuts

On vertices and facets of combinatorial 2-level polytopes

A Bayesian Method for Matching Two Similar Graphs without Seeds

Robust Non-Rigid Registration of 2D and 3D Graphs

Clustering with Multi-Layer Graphs: A Spectral Perspective

Learning of Structured Graph Dictionaries