Abstract: We prove a characterization of all polynomial-time computable queries on the class of interval graphs by sentences of fixed-point logic with counting. More precisely, it is shown that on the ...

Overview This project implements algorithms from the paper "Tracking Paths in Polynomial Time", which explores solutions to the Tracking Paths Problem—determining a minimal set of vertices (or edges) ...

Bernstein polynomial estimation provides a robust nonparametric technique for approximating both density and distribution functions. Based on the properties of Bernstein polynomials, which uniformly ...

The statistical physics of graphs and partition functions represents a vibrant intersection of graph theory, statistical mechanics and computational complexity. By summing over an ensemble of ...

Abstract: This paper presents a polynomial approximation method for filtering of signals defined on directed graphs. For spectral graph filtering, the polynomial approximation is often used to avoid ...