Graph filtering is a fundamental tool in graph signal processing. Polynomial graph filters (PGFs), defined as polynomials of a fundamental graph operator, can be implemented in the vertex domain, and ...

Chebyshev interpolation polynomials exhibit the exponential approximation property to analytic functions on a cube. Based on the Chebyshev interpolation polynomial approximation, we propose iterative ...

It replaces the graph convolution with a FIR filter (i.e. the use of a polynomial of the shift operator) by an ratio of polynomials. This architecture offers a good trade-off between number of ...

PolyGCL: GRAPH CONTRASTIVE LEARNING via Learnable Spectral Polynomial Filters This repository contains a PyTorch implementation of ICLR 2024 paper " PolyGCL: GRAPH CONTRASTIVE LEARNING via Learnable ...

Graph Enumeration Problems Graph Colorings and Chromatic Structures Boolean Satisfiability Induced Operators: Induced Operators and Kravchuk Polynomials Graph-Induced Operators Solutions and Hints to ...