Edge-disjoint cycles with the same vertex set

About
Privacy
Disclaimer

Graph Chatbot

Related publications (5)

Page 1 of 1

Socially Intelligent Networks: A framework for decision making over graphs

Ali H. Sayed

By 'social learning,' in this article we refer to mechanisms for opinion formation and decision making over graphs and the study of how agents' decisions evolve dynamically through interactions with neighbors and the environment. The study of social learni ...

2024

On some problems related to 2-level polytopes

Manuel Francesco Aprile

In this thesis we investigate a number of problems related to 2-level polytopes, in particular from the point of view of the combinatorial structure and the extension complexity. 2-level polytopes were introduced as a generalization of stable set polytopes ...

EPFL2018

A Novel Method for Sampling Bandlimited Graph Signals

Pascal Frossard, Pinar Akyazi

In this paper we propose a novel vertex based sampling method for k-bandlimited signals lying on arbitrary graphs, that has a reasonable computational complexity and results in low reconstruction error. Our goal is to find the smallest set of vertices that ...

IEEE COMPUTER SOC2018

Methods and apparatuses for encoding and decoding digital images or video streams

Pascal Frossard, Ntorina Thanou, Giulia Fracastoro

The invention relates to a method and an apparatus for encoding and/or decoding digital images, wherein said encoding apparatus (1100) comprises processing means (1110) configured for determining weights of a graph related to an image by minimizing a cost ...

2018

Robust Principal Component Analysis on Graphs

Pierre Vandergheynst, Xavier Bresson, Michael Bronstein, Vasilis Kalofolias, Nauman Shahid

Principal Component Analysis (PCA) is the most widely used tool for linear dimensionality reduction and clustering. Still it is highly sensitive to outliers and does not scale well with respect to the number of data samples. Robust PCA solves the first iss ...

2015